./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 0f8a17c6 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.1-dev-0f8a17c [2021-11-17 02:49:43,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 02:49:43,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 02:49:43,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 02:49:43,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 02:49:43,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 02:49:43,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 02:49:43,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 02:49:43,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 02:49:43,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 02:49:43,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 02:49:43,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 02:49:43,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 02:49:43,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 02:49:43,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 02:49:43,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 02:49:43,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 02:49:43,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 02:49:43,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 02:49:43,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 02:49:43,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 02:49:43,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 02:49:43,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 02:49:43,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 02:49:43,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 02:49:43,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 02:49:43,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 02:49:43,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 02:49:43,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 02:49:43,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 02:49:43,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 02:49:43,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 02:49:43,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 02:49:43,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 02:49:43,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 02:49:43,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 02:49:43,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 02:49:43,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 02:49:43,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 02:49:43,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 02:49:43,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 02:49:43,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 02:49:43,447 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 02:49:43,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 02:49:43,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 02:49:43,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 02:49:43,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 02:49:43,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 02:49:43,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 02:49:43,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 02:49:43,450 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 02:49:43,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 02:49:43,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 02:49:43,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 02:49:43,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 02:49:43,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 02:49:43,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 02:49:43,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 02:49:43,452 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 02:49:43,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 02:49:43,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 02:49:43,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 02:49:43,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 02:49:43,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 02:49:43,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 02:49:43,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 02:49:43,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 02:49:43,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 02:49:43,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 02:49:43,456 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 02:49:43,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 02:49:43,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 02:49:43,456 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 02:49:43,456 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-11-17 02:49:43,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 02:49:43,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 02:49:43,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 02:49:43,715 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 02:49:43,715 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 02:49:43,716 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-11-17 02:49:43,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d8509ea/c469940d0be9482ea0f76421b93449fd/FLAG1bef4364d [2021-11-17 02:49:44,410 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 02:49:44,412 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-11-17 02:49:44,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d8509ea/c469940d0be9482ea0f76421b93449fd/FLAG1bef4364d [2021-11-17 02:49:44,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d8509ea/c469940d0be9482ea0f76421b93449fd [2021-11-17 02:49:44,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 02:49:44,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 02:49:44,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 02:49:44,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 02:49:44,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 02:49:44,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:49:44" (1/1) ... [2021-11-17 02:49:44,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f17280f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:44, skipping insertion in model container [2021-11-17 02:49:44,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:49:44" (1/1) ... [2021-11-17 02:49:44,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 02:49:44,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 02:49:45,199 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-11-17 02:49:45,219 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 02:49:45,235 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 02:49:45,399 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-11-17 02:49:45,410 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 02:49:45,440 INFO L208 MainTranslator]: Completed translation [2021-11-17 02:49:45,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45 WrapperNode [2021-11-17 02:49:45,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 02:49:45,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 02:49:45,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 02:49:45,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 02:49:45,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (1/1) ... [2021-11-17 02:49:45,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (1/1) ... [2021-11-17 02:49:45,525 INFO L137 Inliner]: procedures = 68, calls = 170, calls flagged for inlining = 22, calls inlined = 15, statements flattened = 337 [2021-11-17 02:49:45,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 02:49:45,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 02:49:45,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 02:49:45,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 02:49:45,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (1/1) ... [2021-11-17 02:49:45,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (1/1) ... [2021-11-17 02:49:45,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (1/1) ... [2021-11-17 02:49:45,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (1/1) ... [2021-11-17 02:49:45,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (1/1) ... [2021-11-17 02:49:45,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (1/1) ... [2021-11-17 02:49:45,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (1/1) ... [2021-11-17 02:49:45,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 02:49:45,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 02:49:45,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 02:49:45,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 02:49:45,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (1/1) ... [2021-11-17 02:49:45,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 02:49:45,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:49:45,652 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-11-17 02:49:45,675 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-11-17 02:49:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 02:49:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 02:49:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 02:49:45,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 02:49:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 02:49:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 02:49:45,696 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 02:49:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 02:49:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2021-11-17 02:49:45,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2021-11-17 02:49:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 02:49:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 02:49:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 02:49:45,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 02:49:45,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-11-17 02:49:45,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-11-17 02:49:45,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 02:49:45,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 02:49:45,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 02:49:45,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 02:49:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 02:49:45,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 02:49:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2021-11-17 02:49:45,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2021-11-17 02:49:45,911 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 02:49:45,913 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 02:49:45,961 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 02:49:46,156 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 02:49:46,164 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 02:49:46,165 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-17 02:49:46,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:49:46 BoogieIcfgContainer [2021-11-17 02:49:46,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 02:49:46,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 02:49:46,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 02:49:46,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 02:49:46,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:49:44" (1/3) ... [2021-11-17 02:49:46,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8b17e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:49:46, skipping insertion in model container [2021-11-17 02:49:46,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:45" (2/3) ... [2021-11-17 02:49:46,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8b17e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:49:46, skipping insertion in model container [2021-11-17 02:49:46,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:49:46" (3/3) ... [2021-11-17 02:49:46,175 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2021-11-17 02:49:46,179 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 02:49:46,179 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 02:49:46,216 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 02:49:46,221 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-11-17 02:49:46,222 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 02:49:46,241 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-11-17 02:49:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-17 02:49:46,248 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:46,249 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-11-17 02:49:46,249 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1422532354, now seen corresponding path program 1 times [2021-11-17 02:49:46,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:46,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054650473] [2021-11-17 02:49:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:46,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:46,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:46,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:46,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 02:49:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-17 02:49:46,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:46,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054650473] [2021-11-17 02:49:46,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054650473] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:46,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:49:46,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 02:49:46,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082363213] [2021-11-17 02:49:46,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:46,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:49:46,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:46,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:49:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 02:49:46,824 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-11-17 02:49:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:46,989 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2021-11-17 02:49:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 02:49:46,992 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-11-17 02:49:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:47,001 INFO L225 Difference]: With dead ends: 181 [2021-11-17 02:49:47,001 INFO L226 Difference]: Without dead ends: 85 [2021-11-17 02:49:47,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-17 02:49:47,008 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-11-17 02:49:47,012 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-11-17 02:49:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-17 02:49:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2021-11-17 02:49:47,047 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-11-17 02:49:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2021-11-17 02:49:47,050 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 61 [2021-11-17 02:49:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:47,050 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2021-11-17 02:49:47,051 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-11-17 02:49:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2021-11-17 02:49:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-17 02:49:47,053 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:47,053 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-11-17 02:49:47,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 02:49:47,053 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:47,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash 147371386, now seen corresponding path program 1 times [2021-11-17 02:49:47,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:47,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450140781] [2021-11-17 02:49:47,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:47,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 02:49:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-17 02:49:47,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:47,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450140781] [2021-11-17 02:49:47,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450140781] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:47,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:49:47,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 02:49:47,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080712435] [2021-11-17 02:49:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:47,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:49:47,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:47,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:49:47,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 02:49:47,231 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-11-17 02:49:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:47,444 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2021-11-17 02:49:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:49:47,445 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-11-17 02:49:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:47,450 INFO L225 Difference]: With dead ends: 179 [2021-11-17 02:49:47,450 INFO L226 Difference]: Without dead ends: 128 [2021-11-17 02:49:47,451 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-11-17 02:49:47,452 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-11-17 02:49:47,452 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-11-17 02:49:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-17 02:49:47,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2021-11-17 02:49:47,463 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-11-17 02:49:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2021-11-17 02:49:47,465 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 61 [2021-11-17 02:49:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:47,465 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2021-11-17 02:49:47,465 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-11-17 02:49:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2021-11-17 02:49:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-17 02:49:47,467 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:47,467 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-11-17 02:49:47,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 02:49:47,468 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash 668155054, now seen corresponding path program 1 times [2021-11-17 02:49:47,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:47,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096552260] [2021-11-17 02:49:47,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:47,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 02:49:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-17 02:49:47,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:47,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096552260] [2021-11-17 02:49:47,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096552260] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:47,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:49:47,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 02:49:47,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428333236] [2021-11-17 02:49:47,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:47,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:49:47,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:47,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:49:47,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 02:49:47,599 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-11-17 02:49:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:47,715 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2021-11-17 02:49:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:49:47,716 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-11-17 02:49:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:47,718 INFO L225 Difference]: With dead ends: 135 [2021-11-17 02:49:47,718 INFO L226 Difference]: Without dead ends: 130 [2021-11-17 02:49:47,718 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-11-17 02:49:47,719 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 126 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-17 02:49:47,720 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-11-17 02:49:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-17 02:49:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2021-11-17 02:49:47,729 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-11-17 02:49:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 160 transitions. [2021-11-17 02:49:47,731 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 160 transitions. Word has length 64 [2021-11-17 02:49:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:47,731 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 160 transitions. [2021-11-17 02:49:47,731 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-11-17 02:49:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 160 transitions. [2021-11-17 02:49:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-17 02:49:47,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:47,733 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-11-17 02:49:47,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 02:49:47,734 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 725413356, now seen corresponding path program 1 times [2021-11-17 02:49:47,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:47,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214818707] [2021-11-17 02:49:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:47,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 02:49:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-17 02:49:47,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:47,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214818707] [2021-11-17 02:49:47,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214818707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:47,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:49:47,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 02:49:47,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247960346] [2021-11-17 02:49:47,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:47,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:49:47,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:49:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 02:49:47,891 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-11-17 02:49:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:48,055 INFO L93 Difference]: Finished difference Result 304 states and 419 transitions. [2021-11-17 02:49:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:49:48,056 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-11-17 02:49:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:48,058 INFO L225 Difference]: With dead ends: 304 [2021-11-17 02:49:48,058 INFO L226 Difference]: Without dead ends: 209 [2021-11-17 02:49:48,063 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-11-17 02:49:48,065 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-11-17 02:49:48,066 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-11-17 02:49:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-17 02:49:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2021-11-17 02:49:48,091 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-11-17 02:49:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2021-11-17 02:49:48,093 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 64 [2021-11-17 02:49:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:48,095 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2021-11-17 02:49:48,095 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-11-17 02:49:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2021-11-17 02:49:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-17 02:49:48,099 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:48,099 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-11-17 02:49:48,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 02:49:48,099 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:48,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:48,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1104607523, now seen corresponding path program 1 times [2021-11-17 02:49:48,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:48,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164019692] [2021-11-17 02:49:48,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:48,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 02:49:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-17 02:49:48,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:48,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164019692] [2021-11-17 02:49:48,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164019692] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:48,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:49:48,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 02:49:48,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653331444] [2021-11-17 02:49:48,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:48,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:49:48,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:48,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:49:48,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 02:49:48,275 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-11-17 02:49:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:48,385 INFO L93 Difference]: Finished difference Result 443 states and 613 transitions. [2021-11-17 02:49:48,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 02:49:48,386 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-11-17 02:49:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:48,388 INFO L225 Difference]: With dead ends: 443 [2021-11-17 02:49:48,388 INFO L226 Difference]: Without dead ends: 272 [2021-11-17 02:49:48,390 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-11-17 02:49:48,391 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.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:49:48,391 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.1s Time] [2021-11-17 02:49:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-17 02:49:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2021-11-17 02:49:48,414 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-11-17 02:49:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2021-11-17 02:49:48,416 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 70 [2021-11-17 02:49:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:48,417 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2021-11-17 02:49:48,417 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-11-17 02:49:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2021-11-17 02:49:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-17 02:49:48,420 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:48,420 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-11-17 02:49:48,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 02:49:48,420 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash -49701621, now seen corresponding path program 1 times [2021-11-17 02:49:48,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:48,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894232424] [2021-11-17 02:49:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:48,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 02:49:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-17 02:49:48,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:48,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894232424] [2021-11-17 02:49:48,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894232424] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:49:48,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087766403] [2021-11-17 02:49:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:48,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:49:48,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:49:48,655 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-11-17 02:49:48,688 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-11-17 02:49:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:48,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-17 02:49:48,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:49:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-17 02:49:49,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:49:49,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087766403] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:49,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:49:49,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2021-11-17 02:49:49,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914391459] [2021-11-17 02:49:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:49,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 02:49:49,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:49,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 02:49:49,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-17 02:49:49,190 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), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-17 02:49:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:49,222 INFO L93 Difference]: Finished difference Result 504 states and 696 transitions. [2021-11-17 02:49:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 02:49:49,223 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), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 81 [2021-11-17 02:49:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:49,226 INFO L225 Difference]: With dead ends: 504 [2021-11-17 02:49:49,227 INFO L226 Difference]: Without dead ends: 262 [2021-11-17 02:49:49,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-17 02:49:49,228 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-11-17 02:49:49,229 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-11-17 02:49:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-17 02:49:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-11-17 02:49:49,239 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-11-17 02:49:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2021-11-17 02:49:49,242 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 81 [2021-11-17 02:49:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:49,242 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2021-11-17 02:49:49,242 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), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-17 02:49:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2021-11-17 02:49:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-17 02:49:49,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:49,252 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-11-17 02:49:49,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-17 02:49:49,477 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-11-17 02:49:49,478 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:49,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1260616323, now seen corresponding path program 1 times [2021-11-17 02:49:49,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:49,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913223626] [2021-11-17 02:49:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:49,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:49,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:49,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:49,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:49,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-17 02:49:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-17 02:49:49,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:49,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913223626] [2021-11-17 02:49:49,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913223626] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:49:49,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973451230] [2021-11-17 02:49:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:49,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:49:49,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:49:49,738 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-11-17 02:49:49,767 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-11-17 02:49:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:49,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-17 02:49:49,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:49:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-17 02:49:50,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:49:50,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973451230] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:50,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:49:50,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-11-17 02:49:50,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266905073] [2021-11-17 02:49:50,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:50,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:49:50,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:49:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-17 02:49:50,133 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-11-17 02:49:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:50,183 INFO L93 Difference]: Finished difference Result 825 states and 1152 transitions. [2021-11-17 02:49:50,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:49:50,184 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-11-17 02:49:50,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:50,187 INFO L225 Difference]: With dead ends: 825 [2021-11-17 02:49:50,187 INFO L226 Difference]: Without dead ends: 594 [2021-11-17 02:49:50,187 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-11-17 02:49:50,188 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-11-17 02:49:50,188 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-11-17 02:49:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-11-17 02:49:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 268. [2021-11-17 02:49:50,201 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-11-17 02:49:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 362 transitions. [2021-11-17 02:49:50,202 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 362 transitions. Word has length 83 [2021-11-17 02:49:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:50,203 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 362 transitions. [2021-11-17 02:49:50,203 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-11-17 02:49:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 362 transitions. [2021-11-17 02:49:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-17 02:49:50,204 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:50,204 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-11-17 02:49:50,231 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-11-17 02:49:50,420 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-11-17 02:49:50,421 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1940674693, now seen corresponding path program 1 times [2021-11-17 02:49:50,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:50,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771595553] [2021-11-17 02:49:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:50,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:50,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:50,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:50,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:50,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-17 02:49:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 02:49:50,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:50,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771595553] [2021-11-17 02:49:50,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771595553] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:49:50,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451949337] [2021-11-17 02:49:50,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:50,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:49:50,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:49:50,554 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-11-17 02:49:50,585 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-11-17 02:49:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:50,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 02:49:50,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:49:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-17 02:49:50,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:49:50,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451949337] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:50,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:49:50,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-17 02:49:50,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042402103] [2021-11-17 02:49:50,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:50,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 02:49:50,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:50,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 02:49:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 02:49:50,892 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-11-17 02:49:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:50,911 INFO L93 Difference]: Finished difference Result 643 states and 888 transitions. [2021-11-17 02:49:50,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 02:49:50,915 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-11-17 02:49:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:50,918 INFO L225 Difference]: With dead ends: 643 [2021-11-17 02:49:50,918 INFO L226 Difference]: Without dead ends: 406 [2021-11-17 02:49:50,919 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-11-17 02:49:50,919 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-11-17 02:49:50,920 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-11-17 02:49:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-17 02:49:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 255. [2021-11-17 02:49:50,931 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-11-17 02:49:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 345 transitions. [2021-11-17 02:49:50,933 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 345 transitions. Word has length 83 [2021-11-17 02:49:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:50,933 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 345 transitions. [2021-11-17 02:49:50,933 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-11-17 02:49:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 345 transitions. [2021-11-17 02:49:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-17 02:49:50,934 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:50,934 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-11-17 02:49:50,963 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-11-17 02:49:51,135 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-11-17 02:49:51,135 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:51,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:51,136 INFO L85 PathProgramCache]: Analyzing trace with hash 587922057, now seen corresponding path program 1 times [2021-11-17 02:49:51,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:51,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163946870] [2021-11-17 02:49:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:51,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-17 02:49:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-17 02:49:51,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:51,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163946870] [2021-11-17 02:49:51,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163946870] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:51,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:49:51,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 02:49:51,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509656630] [2021-11-17 02:49:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:51,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 02:49:51,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 02:49:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-17 02:49:51,306 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-11-17 02:49:51,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:51,491 INFO L93 Difference]: Finished difference Result 384 states and 524 transitions. [2021-11-17 02:49:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 02:49:51,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-11-17 02:49:51,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:51,497 INFO L225 Difference]: With dead ends: 384 [2021-11-17 02:49:51,497 INFO L226 Difference]: Without dead ends: 381 [2021-11-17 02:49:51,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-17 02:49:51,501 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-11-17 02:49:51,501 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-11-17 02:49:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-17 02:49:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 374. [2021-11-17 02:49:51,519 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-11-17 02:49:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 514 transitions. [2021-11-17 02:49:51,521 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 514 transitions. Word has length 85 [2021-11-17 02:49:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:51,522 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 514 transitions. [2021-11-17 02:49:51,522 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-11-17 02:49:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 514 transitions. [2021-11-17 02:49:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-17 02:49:51,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:51,523 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-11-17 02:49:51,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 02:49:51,524 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 138660115, now seen corresponding path program 1 times [2021-11-17 02:49:51,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:51,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973017300] [2021-11-17 02:49:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:51,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-17 02:49:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-17 02:49:51,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:51,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973017300] [2021-11-17 02:49:51,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973017300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:51,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:49:51,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 02:49:51,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143088895] [2021-11-17 02:49:51,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:51,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 02:49:51,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:51,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 02:49:51,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 02:49:51,690 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-11-17 02:49:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:51,799 INFO L93 Difference]: Finished difference Result 773 states and 1076 transitions. [2021-11-17 02:49:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:49:51,799 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-11-17 02:49:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:51,802 INFO L225 Difference]: With dead ends: 773 [2021-11-17 02:49:51,802 INFO L226 Difference]: Without dead ends: 525 [2021-11-17 02:49:51,803 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-11-17 02:49:51,803 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-17 02:49:51,804 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-11-17 02:49:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-11-17 02:49:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 374. [2021-11-17 02:49:51,818 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-11-17 02:49:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 510 transitions. [2021-11-17 02:49:51,819 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 510 transitions. Word has length 92 [2021-11-17 02:49:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:51,820 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 510 transitions. [2021-11-17 02:49:51,820 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-11-17 02:49:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 510 transitions. [2021-11-17 02:49:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-17 02:49:51,821 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:51,821 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-11-17 02:49:51,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 02:49:51,821 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:51,822 INFO L85 PathProgramCache]: Analyzing trace with hash -882408239, now seen corresponding path program 1 times [2021-11-17 02:49:51,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:51,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496166667] [2021-11-17 02:49:51,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:51,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-17 02:49:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 02:49:51,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:51,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496166667] [2021-11-17 02:49:51,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496166667] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:49:51,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293580102] [2021-11-17 02:49:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:51,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:49:51,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:49:51,973 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-11-17 02:49:51,975 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-11-17 02:49:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-17 02:49:52,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:49:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-17 02:49:52,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:49:52,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293580102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:52,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:49:52,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2021-11-17 02:49:52,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351912267] [2021-11-17 02:49:52,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:52,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 02:49:52,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:52,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 02:49:52,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-17 02:49:52,377 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-11-17 02:49:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:52,433 INFO L93 Difference]: Finished difference Result 940 states and 1311 transitions. [2021-11-17 02:49:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 02:49:52,434 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-11-17 02:49:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:52,436 INFO L225 Difference]: With dead ends: 940 [2021-11-17 02:49:52,436 INFO L226 Difference]: Without dead ends: 692 [2021-11-17 02:49:52,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-17 02:49:52,438 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-11-17 02:49:52,438 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-11-17 02:49:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-11-17 02:49:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 374. [2021-11-17 02:49:52,471 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-11-17 02:49:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 506 transitions. [2021-11-17 02:49:52,473 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 506 transitions. Word has length 92 [2021-11-17 02:49:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:52,473 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 506 transitions. [2021-11-17 02:49:52,473 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-11-17 02:49:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 506 transitions. [2021-11-17 02:49:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-17 02:49:52,475 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:52,475 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-11-17 02:49:52,505 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-11-17 02:49:52,699 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-11-17 02:49:52,699 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2027716343, now seen corresponding path program 1 times [2021-11-17 02:49:52,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:52,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46788858] [2021-11-17 02:49:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:52,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-17 02:49:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 02:49:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-17 02:49:52,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:52,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46788858] [2021-11-17 02:49:52,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46788858] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:49:52,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020662841] [2021-11-17 02:49:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:52,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:49:52,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:49:52,915 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-11-17 02:49:52,916 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-11-17 02:49:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:53,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-17 02:49:53,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:49:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-17 02:49:53,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 02:49:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-17 02:49:53,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020662841] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 02:49:53,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 02:49:53,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-11-17 02:49:53,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383056145] [2021-11-17 02:49:53,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 02:49:53,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-17 02:49:53,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:53,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-17 02:49:53,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-11-17 02:49:53,614 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-11-17 02:49:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:54,003 INFO L93 Difference]: Finished difference Result 739 states and 1006 transitions. [2021-11-17 02:49:54,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 02:49:54,003 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-11-17 02:49:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:54,005 INFO L225 Difference]: With dead ends: 739 [2021-11-17 02:49:54,005 INFO L226 Difference]: Without dead ends: 381 [2021-11-17 02:49:54,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2021-11-17 02:49:54,007 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 64 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 02:49:54,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 728 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 02:49:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-17 02:49:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-11-17 02:49:54,021 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-11-17 02:49:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 513 transitions. [2021-11-17 02:49:54,023 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 513 transitions. Word has length 99 [2021-11-17 02:49:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:54,023 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 513 transitions. [2021-11-17 02:49:54,024 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-11-17 02:49:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 513 transitions. [2021-11-17 02:49:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-17 02:49:54,025 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:54,026 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-11-17 02:49:54,049 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-11-17 02:49:54,239 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-11-17 02:49:54,239 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1894269569, now seen corresponding path program 2 times [2021-11-17 02:49:54,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:54,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477493904] [2021-11-17 02:49:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:54,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:54,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:54,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:54,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:54,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:54,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 02:49:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 02:49:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-17 02:49:54,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:54,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477493904] [2021-11-17 02:49:54,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477493904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:54,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:49:54,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 02:49:54,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854036620] [2021-11-17 02:49:54,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:54,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 02:49:54,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:54,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 02:49:54,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-17 02:49:54,438 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-11-17 02:49:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:54,657 INFO L93 Difference]: Finished difference Result 964 states and 1323 transitions. [2021-11-17 02:49:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 02:49:54,658 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-11-17 02:49:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:54,660 INFO L225 Difference]: With dead ends: 964 [2021-11-17 02:49:54,660 INFO L226 Difference]: Without dead ends: 617 [2021-11-17 02:49:54,661 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-11-17 02:49:54,661 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 82 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 02:49:54,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 814 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 02:49:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-11-17 02:49:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 393. [2021-11-17 02:49:54,677 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-11-17 02:49:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 525 transitions. [2021-11-17 02:49:54,679 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 525 transitions. Word has length 105 [2021-11-17 02:49:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:54,679 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 525 transitions. [2021-11-17 02:49:54,679 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-11-17 02:49:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 525 transitions. [2021-11-17 02:49:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-17 02:49:54,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:54,680 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-11-17 02:49:54,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 02:49:54,680 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1192669695, now seen corresponding path program 1 times [2021-11-17 02:49:54,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:54,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959534264] [2021-11-17 02:49:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:54,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:55,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:55,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:55,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:55,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:55,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 02:49:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:55,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 02:49:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-17 02:49:55,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:55,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959534264] [2021-11-17 02:49:55,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959534264] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:49:55,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220753656] [2021-11-17 02:49:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:55,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:49:55,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:49:55,928 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-11-17 02:49:55,938 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-11-17 02:49:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:56,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-17 02:49:56,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:49:56,503 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-17 02:49:56,503 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-11-17 02:49:56,514 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-17 02:49:56,515 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-11-17 02:49:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-17 02:49:56,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:49:56,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220753656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:56,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:49:56,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [23] total 28 [2021-11-17 02:49:56,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730038270] [2021-11-17 02:49:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:56,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 02:49:56,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 02:49:56,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2021-11-17 02:49:56,677 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-11-17 02:49:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:56,878 INFO L93 Difference]: Finished difference Result 870 states and 1171 transitions. [2021-11-17 02:49:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 02:49:56,878 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-11-17 02:49:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:56,881 INFO L225 Difference]: With dead ends: 870 [2021-11-17 02:49:56,881 INFO L226 Difference]: Without dead ends: 602 [2021-11-17 02:49:56,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2021-11-17 02:49:56,882 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-11-17 02:49:56,882 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-11-17 02:49:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-11-17 02:49:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 284. [2021-11-17 02:49:56,897 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-11-17 02:49:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 370 transitions. [2021-11-17 02:49:56,899 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 370 transitions. Word has length 105 [2021-11-17 02:49:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:56,899 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 370 transitions. [2021-11-17 02:49:56,899 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-11-17 02:49:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 370 transitions. [2021-11-17 02:49:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-17 02:49:56,900 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:56,901 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-11-17 02:49:56,929 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-11-17 02:49:57,125 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-11-17 02:49:57,125 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1062893161, now seen corresponding path program 1 times [2021-11-17 02:49:57,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:57,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048052798] [2021-11-17 02:49:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:57,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 02:49:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 02:49:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-17 02:49:57,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:57,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048052798] [2021-11-17 02:49:57,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048052798] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:57,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 02:49:57,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 02:49:57,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478925325] [2021-11-17 02:49:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:57,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 02:49:57,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:57,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 02:49:57,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-17 02:49:57,326 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-11-17 02:49:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:57,493 INFO L93 Difference]: Finished difference Result 286 states and 371 transitions. [2021-11-17 02:49:57,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 02:49:57,494 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-11-17 02:49:57,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:57,495 INFO L225 Difference]: With dead ends: 286 [2021-11-17 02:49:57,495 INFO L226 Difference]: Without dead ends: 279 [2021-11-17 02:49:57,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-17 02:49:57,496 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 163 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 02:49:57,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 286 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 02:49:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-11-17 02:49:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2021-11-17 02:49:57,508 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-11-17 02:49:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 361 transitions. [2021-11-17 02:49:57,510 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 361 transitions. Word has length 107 [2021-11-17 02:49:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:57,510 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 361 transitions. [2021-11-17 02:49:57,510 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-11-17 02:49:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 361 transitions. [2021-11-17 02:49:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-17 02:49:57,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 02:49:57,511 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-11-17 02:49:57,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 02:49:57,512 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 02:49:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 02:49:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1411237866, now seen corresponding path program 1 times [2021-11-17 02:49:57,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 02:49:57,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302773038] [2021-11-17 02:49:57,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:57,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 02:49:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 02:49:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 02:49:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 02:49:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 02:49:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 02:49:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 02:49:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 02:49:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-17 02:49:57,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 02:49:57,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302773038] [2021-11-17 02:49:57,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302773038] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 02:49:57,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937324999] [2021-11-17 02:49:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 02:49:57,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 02:49:57,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 02:49:57,668 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-11-17 02:49:57,669 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-11-17 02:49:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 02:49:57,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-17 02:49:57,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 02:49:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-17 02:49:58,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 02:49:58,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937324999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 02:49:58,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 02:49:58,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2021-11-17 02:49:58,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215695582] [2021-11-17 02:49:58,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 02:49:58,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 02:49:58,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 02:49:58,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 02:49:58,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 02:49:58,082 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-11-17 02:49:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 02:49:58,123 INFO L93 Difference]: Finished difference Result 279 states and 361 transitions. [2021-11-17 02:49:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 02:49:58,124 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-11-17 02:49:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 02:49:58,124 INFO L225 Difference]: With dead ends: 279 [2021-11-17 02:49:58,125 INFO L226 Difference]: Without dead ends: 0 [2021-11-17 02:49:58,125 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-11-17 02:49:58,126 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-11-17 02:49:58,126 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-11-17 02:49:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-17 02:49:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-17 02:49:58,127 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-11-17 02:49:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-17 02:49:58,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2021-11-17 02:49:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 02:49:58,127 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-17 02:49:58,128 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-11-17 02:49:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-17 02:49:58,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-17 02:49:58,130 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-17 02:49:58,155 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-11-17 02:49:58,355 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-11-17 02:49:58,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-17 02:50:00,724 INFO L858 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5894 5904) no Hoare annotation was computed. [2021-11-17 02:50:00,724 INFO L854 garLoopResultBuilder]: At program point L5899(line 5899) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2021-11-17 02:50:00,724 INFO L858 garLoopResultBuilder]: For program point L5899-1(line 5899) no Hoare annotation was computed. [2021-11-17 02:50:00,724 INFO L861 garLoopResultBuilder]: At program point L5901(line 5901) the Hoare annotation is: true [2021-11-17 02:50:00,724 INFO L858 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5894 5904) no Hoare annotation was computed. [2021-11-17 02:50:00,724 INFO L858 garLoopResultBuilder]: For program point L5901-1(line 5901) no Hoare annotation was computed. [2021-11-17 02:50:00,725 INFO L854 garLoopResultBuilder]: At program point ldv_init_zallocENTRY(lines 5894 5904) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) [2021-11-17 02:50:00,725 INFO L858 garLoopResultBuilder]: For program point L5858-2(lines 5857 5859) no Hoare annotation was computed. [2021-11-17 02:50:00,725 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5857 5859) the Hoare annotation is: true [2021-11-17 02:50:00,725 INFO L858 garLoopResultBuilder]: For program point L5858(line 5858) no Hoare annotation was computed. [2021-11-17 02:50:00,725 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5857 5859) no Hoare annotation was computed. [2021-11-17 02:50:00,725 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6260 6266) no Hoare annotation was computed. [2021-11-17 02:50:00,725 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6260 6266) the Hoare annotation is: true [2021-11-17 02:50:00,725 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2021-11-17 02:50:00,725 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6260 6266) no Hoare annotation was computed. [2021-11-17 02:50:00,725 INFO L858 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5929 5935) no Hoare annotation was computed. [2021-11-17 02:50:00,725 INFO L861 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5929 5935) the Hoare annotation is: true [2021-11-17 02:50:00,725 INFO L858 garLoopResultBuilder]: For program point L6113-2(lines 6113 6116) no Hoare annotation was computed. [2021-11-17 02:50:00,725 INFO L858 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2021-11-17 02:50:00,725 INFO L854 garLoopResultBuilder]: At program point L6394(lines 6393 6395) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_0~0 0)) [2021-11-17 02:50:00,726 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-11-17 02:50:00,726 INFO L858 garLoopResultBuilder]: For program point L6204(lines 6204 6209) no Hoare annotation was computed. [2021-11-17 02:50:00,726 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 ((.cse1 (select (select |#memory_$Pointer$.offset| .cse5) .cse6)) (.cse0 (select (select |#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse2 (= ~ldv_retval_0~0 0)) (.cse3 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0)) (.cse4 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1))) (or (and (<= 2 ~ldv_module_refcounter~0) (<= 1 |ULTIMATE.start_ldv_try_module_get_#res#1|) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (<= ~ldv_module_refcounter~0 2) .cse2 .cse3 .cse4) (and (= ~ldv_module_refcounter~0 1) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse2 .cse3 .cse4)))))) [2021-11-17 02:50:00,726 INFO L858 garLoopResultBuilder]: For program point L6320(lines 6320 6325) no Hoare annotation was computed. [2021-11-17 02:50:00,726 INFO L854 garLoopResultBuilder]: At program point L6221(lines 6167 6242) the Hoare annotation is: (= ~ldv_module_refcounter~0 1) [2021-11-17 02:50:00,726 INFO L858 garLoopResultBuilder]: For program point L6180(lines 6180 6236) no Hoare annotation was computed. [2021-11-17 02:50:00,726 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-17 02:50:00,726 INFO L858 garLoopResultBuilder]: For program point L6362(lines 6362 6365) no Hoare annotation was computed. [2021-11-17 02:50:00,726 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-17 02:50:00,726 INFO L861 garLoopResultBuilder]: At program point L6362-1(lines 6359 6368) the Hoare annotation is: true [2021-11-17 02:50:00,726 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 (= (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616) 0)) (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (<= 2 ~ldv_module_refcounter~0) (<= 1 |ULTIMATE.start_ldv_try_module_get_#res#1|) (<= 1 |ULTIMATE.start_pppox_create_~tmp~8#1|) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (<= |ULTIMATE.start_pppox_create_~tmp~8#1| 1) (<= ~ldv_module_refcounter~0 2) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))) [2021-11-17 02:50:00,727 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 (= ~ldv_module_refcounter~0 1) (not (= (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616) 0)) (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_#res#1|) (<= 1 |ULTIMATE.start_pppox_create_~tmp~8#1|) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (<= |ULTIMATE.start_pppox_create_~tmp~8#1| 1) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))) [2021-11-17 02:50:00,727 INFO L858 garLoopResultBuilder]: For program point L6214(lines 6214 6218) no Hoare annotation was computed. [2021-11-17 02:50:00,727 INFO L858 garLoopResultBuilder]: For program point L6181(line 6181) no Hoare annotation was computed. [2021-11-17 02:50:00,727 INFO L858 garLoopResultBuilder]: For program point L6214-2(lines 6212 6224) no Hoare annotation was computed. [2021-11-17 02:50:00,727 INFO L854 garLoopResultBuilder]: At program point L6363(line 6363) the Hoare annotation is: false [2021-11-17 02:50:00,727 INFO L854 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-17 02:50:00,727 INFO L858 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2021-11-17 02:50:00,727 INFO L858 garLoopResultBuilder]: For program point L6182(lines 6182 6197) no Hoare annotation was computed. [2021-11-17 02:50:00,727 INFO L854 garLoopResultBuilder]: At program point L6174(line 6174) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-17 02:50:00,727 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) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1))))) [2021-11-17 02:50:00,727 INFO L858 garLoopResultBuilder]: For program point L6174-1(line 6174) no Hoare annotation was computed. [2021-11-17 02:50:00,727 INFO L858 garLoopResultBuilder]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2021-11-17 02:50:00,727 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-11-17 02:50:00,728 INFO L858 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2021-11-17 02:50:00,728 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-11-17 02:50:00,728 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-11-17 02:50:00,728 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 ((.cse1 (select (select |#memory_$Pointer$.offset| .cse5) .cse6)) (.cse0 (select (select |#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse2 (= ~ldv_retval_0~0 0)) (.cse3 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0)) (.cse4 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1))) (or (and (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (<= 2 ~ldv_module_refcounter~0) (<= 1 |ULTIMATE.start_ldv_try_module_get_#res#1|) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (<= ~ldv_module_refcounter~0 2) .cse2 .cse3 .cse4 (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|)) (and (= ~ldv_module_refcounter~0 1) (= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 0) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse2 .cse3 .cse4)))))) [2021-11-17 02:50:00,728 INFO L858 garLoopResultBuilder]: For program point L6117(lines 6117 6130) no Hoare annotation was computed. [2021-11-17 02:50:00,728 INFO L861 garLoopResultBuilder]: At program point L6241(lines 6156 6243) the Hoare annotation is: true [2021-11-17 02:50:00,728 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-11-17 02:50:00,728 INFO L858 garLoopResultBuilder]: For program point L6200(lines 6200 6232) no Hoare annotation was computed. [2021-11-17 02:50:00,728 INFO L858 garLoopResultBuilder]: For program point L6192(line 6192) no Hoare annotation was computed. [2021-11-17 02:50:00,728 INFO L858 garLoopResultBuilder]: For program point L6184(lines 6184 6194) no Hoare annotation was computed. [2021-11-17 02:50:00,728 INFO L854 garLoopResultBuilder]: At program point L6143(lines 6138 6145) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_0~0 0)) [2021-11-17 02:50:00,728 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-17 02:50:00,728 INFO L858 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-11-17 02:50:00,728 INFO L858 garLoopResultBuilder]: For program point L6234(line 6234) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L858 garLoopResultBuilder]: For program point L6168-1(line 6168) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L854 garLoopResultBuilder]: At program point L6168(line 6168) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-17 02:50:00,729 INFO L861 garLoopResultBuilder]: At program point L6193(line 6193) the Hoare annotation is: true [2021-11-17 02:50:00,729 INFO L858 garLoopResultBuilder]: For program point L6185(line 6185) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L861 garLoopResultBuilder]: At program point L6235(line 6235) the Hoare annotation is: true [2021-11-17 02:50:00,729 INFO L858 garLoopResultBuilder]: For program point L6202(lines 6202 6229) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L858 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L858 garLoopResultBuilder]: For program point L6318(lines 6318 6327) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L858 garLoopResultBuilder]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L858 garLoopResultBuilder]: For program point L6211(line 6211) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L858 garLoopResultBuilder]: For program point L6203(line 6203) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L854 garLoopResultBuilder]: At program point L6170(line 6170) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-17 02:50:00,729 INFO L858 garLoopResultBuilder]: For program point L6170-1(line 6170) no Hoare annotation was computed. [2021-11-17 02:50:00,729 INFO L861 garLoopResultBuilder]: At program point L6228(line 6228) the Hoare annotation is: true [2021-11-17 02:50:00,730 INFO L858 garLoopResultBuilder]: For program point L6121-2(lines 6119 6130) no Hoare annotation was computed. [2021-11-17 02:50:00,730 INFO L858 garLoopResultBuilder]: For program point L6121(lines 6121 6125) no Hoare annotation was computed. [2021-11-17 02:50:00,730 INFO L854 garLoopResultBuilder]: At program point L6377(lines 6376 6378) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-11-17 02:50:00,730 INFO L858 garLoopResultBuilder]: For program point L6212(lines 6212 6225) no Hoare annotation was computed. [2021-11-17 02:50:00,730 INFO L858 garLoopResultBuilder]: For program point L6334(lines 6334 6341) no Hoare annotation was computed. [2021-11-17 02:50:00,730 INFO L858 garLoopResultBuilder]: For program point L6335-1(lines 6335 6338) no Hoare annotation was computed. [2021-11-17 02:50:00,730 INFO L858 garLoopResultBuilder]: For program point L6335(lines 6335 6338) no Hoare annotation was computed. [2021-11-17 02:50:00,730 INFO L854 garLoopResultBuilder]: At program point L6336(line 6336) the Hoare annotation is: (or (not (<= |old(~ldv_module_refcounter~0)| 2)) (not (= ~ldv_retval_0~0 0)) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2021-11-17 02:50:00,730 INFO L858 garLoopResultBuilder]: For program point L6334-2(lines 6331 6344) no Hoare annotation was computed. [2021-11-17 02:50:00,730 INFO L854 garLoopResultBuilder]: At program point ldv_module_putENTRY(lines 6331 6344) the Hoare annotation is: (or (not (<= |old(~ldv_module_refcounter~0)| 2)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= ~ldv_retval_0~0 0)) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2021-11-17 02:50:00,730 INFO L858 garLoopResultBuilder]: For program point ldv_module_putEXIT(lines 6331 6344) no Hoare annotation was computed. [2021-11-17 02:50:00,730 INFO L858 garLoopResultBuilder]: For program point ldv_memsetFINAL(lines 5905 5912) no Hoare annotation was computed. [2021-11-17 02:50:00,730 INFO L861 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-11-17 02:50:00,730 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-11-17 02:50:00,730 INFO L854 garLoopResultBuilder]: At program point ldv_memsetENTRY(lines 5905 5912) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2021-11-17 02:50:00,731 INFO L858 garLoopResultBuilder]: For program point ldv_memsetEXIT(lines 5905 5912) no Hoare annotation was computed. [2021-11-17 02:50:00,731 INFO L854 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2021-11-17 02:50:00,731 INFO L858 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2021-11-17 02:50:00,731 INFO L858 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2021-11-17 02:50:00,733 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 02:50:00,734 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-17 02:50:00,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 02:50:00 BoogieIcfgContainer [2021-11-17 02:50:00,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-17 02:50:00,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-17 02:50:00,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-17 02:50:00,792 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-17 02:50:00,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:49:46" (3/4) ... [2021-11-17 02:50:00,798 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-17 02:50:00,803 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2021-11-17 02:50:00,806 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2021-11-17 02:50:00,806 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2021-11-17 02:50:00,806 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2021-11-17 02:50:00,806 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-11-17 02:50:00,806 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2021-11-17 02:50:00,806 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2021-11-17 02:50:00,814 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2021-11-17 02:50:00,815 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-11-17 02:50:00,815 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-17 02:50:00,816 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-17 02:50:00,843 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_module_refcounter == 1 && !((ldv_func_arg1 + ldv_func_arg1) % 18446744073709551616 == 0)) && \result <= 1) && 1 <= \result) && 1 <= tmp) && !((#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 == 0)) && tmp <= 1) && tmp___0 == 0) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && 1 <= \result [2021-11-17 02:50:00,845 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((2 <= ldv_module_refcounter && 1 <= \result) && !((#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 == 0)) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) || ((((ldv_module_refcounter == 1 && \result == 0) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) [2021-11-17 02:50:00,846 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result <= 1 && 2 <= ldv_module_refcounter) && 1 <= \result) && !((#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 == 0)) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && 1 <= \result) || (((((ldv_module_refcounter == 1 && \result == 0) && \result == 0) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) [2021-11-17 02:50:00,891 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-17 02:50:00,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-17 02:50:00,892 INFO L158 Benchmark]: Toolchain (without parser) took 16302.51ms. Allocated memory was 86.0MB in the beginning and 257.9MB in the end (delta: 172.0MB). Free memory was 46.4MB in the beginning and 60.1MB in the end (delta: -13.7MB). Peak memory consumption was 156.4MB. Max. memory is 16.1GB. [2021-11-17 02:50:00,892 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 02:50:00,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 851.11ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 46.2MB in the beginning and 48.1MB in the end (delta: -1.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2021-11-17 02:50:00,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.16ms. Allocated memory is still 107.0MB. Free memory was 48.1MB in the beginning and 44.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-17 02:50:00,893 INFO L158 Benchmark]: Boogie Preprocessor took 79.26ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 44.4MB in the beginning and 96.6MB in the end (delta: -52.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2021-11-17 02:50:00,893 INFO L158 Benchmark]: RCFGBuilder took 556.97ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 69.9MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-17 02:50:00,894 INFO L158 Benchmark]: TraceAbstraction took 14622.40ms. Allocated memory was 142.6MB in the beginning and 257.9MB in the end (delta: 115.3MB). Free memory was 69.3MB in the beginning and 71.6MB in the end (delta: -2.3MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. [2021-11-17 02:50:00,894 INFO L158 Benchmark]: Witness Printer took 99.79ms. Allocated memory is still 257.9MB. Free memory was 71.6MB in the beginning and 60.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-17 02:50:00,906 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.19ms. Allocated memory is still 86.0MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 851.11ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 46.2MB in the beginning and 48.1MB in the end (delta: -1.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.16ms. Allocated memory is still 107.0MB. Free memory was 48.1MB in the beginning and 44.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.26ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 44.4MB in the beginning and 96.6MB in the end (delta: -52.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * RCFGBuilder took 556.97ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 69.9MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14622.40ms. Allocated memory was 142.6MB in the beginning and 257.9MB in the end (delta: 115.3MB). Free memory was 69.3MB in the beginning and 71.6MB in the end (delta: -2.3MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. * Witness Printer took 99.79ms. Allocated memory is still 257.9MB. Free memory was 71.6MB in the beginning and 60.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: 14.5s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1763 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1750 mSDsluCounter, 7281 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5309 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1073 IncrementalHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 1972 mSDtfsCounter, 1073 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1170 GetRequests, 1003 SyntacticMatches, 3 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.7s 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.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1534 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 171 PreInvPairs, 242 NumberOfFragments, 969 HoareAnnotationTreeSize, 171 FomulaSimplifications, 24484 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 35 FomulaSimplificationsInter, 47344 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2031 NumberOfCodeBlocks, 2031 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2106 ConstructedInterpolants, 0 QuantifiedInterpolants, 5473 SizeOfPredicates, 46 NumberOfNonLiveVariables, 5674 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 24 InterpolantComputations, 15 PerfectInterpolantSequences, 853/929 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-11-17 02:50:00,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((\result <= 1 && 2 <= ldv_module_refcounter) && 1 <= \result) && !((#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 == 0)) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && 1 <= \result) || (((((ldv_module_refcounter == 1 && \result == 0) && \result == 0) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && 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_state_variable_0 == 1) && ldv_retval_0 == 0 - InvariantResult [Line: 6314]: Loop Invariant [2021-11-17 02:50:00,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,941 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 && 1 <= \result) && !((#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 == 0)) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) || ((((ldv_module_refcounter == 1 && \result == 0) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) - InvariantResult [Line: 6252]: Loop Invariant [2021-11-17 02:50:00,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((ldv_module_refcounter == 1 && !((ldv_func_arg1 + ldv_func_arg1) % 18446744073709551616 == 0)) && \result <= 1) && 1 <= \result) && 1 <= tmp) && !((#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 == 0)) && tmp <= 1) && tmp___0 == 0) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && 1 <= \result - InvariantResult [Line: 6156]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6376]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_1 == 0) && ldv_retval_0 == 0 - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 - InvariantResult [Line: 6359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 6101]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 5913]: Loop Invariant [2021-11-17 02:50:00,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-17 02:50:00,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-17 02:50:00,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((ldv_module_refcounter == 1 && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][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 == 0)) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && 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_state_variable_0 == 1) && ldv_retval_0 == 0 - InvariantResult [Line: 6106]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 RESULT: Ultimate proved your program to be correct! [2021-11-17 02:50:00,984 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