./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 ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 16:28:02,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 16:28:02,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 16:28:02,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 16:28:02,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 16:28:02,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 16:28:02,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 16:28:02,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 16:28:02,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 16:28:02,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 16:28:02,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 16:28:02,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 16:28:02,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 16:28:02,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 16:28:02,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 16:28:02,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 16:28:02,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 16:28:02,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 16:28:02,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 16:28:02,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 16:28:02,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 16:28:02,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 16:28:02,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 16:28:02,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 16:28:02,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 16:28:02,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 16:28:02,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 16:28:02,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 16:28:02,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 16:28:02,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 16:28:02,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 16:28:02,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 16:28:02,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 16:28:02,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 16:28:02,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 16:28:02,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 16:28:02,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 16:28:02,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 16:28:02,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 16:28:02,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 16:28:02,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 16:28:02,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-21 16:28:02,444 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 16:28:02,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 16:28:02,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 16:28:02,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 16:28:02,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 16:28:02,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 16:28:02,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 16:28:02,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 16:28:02,446 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 16:28:02,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 16:28:02,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 16:28:02,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 16:28:02,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 16:28:02,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 16:28:02,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 16:28:02,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 16:28:02,448 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 16:28:02,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 16:28:02,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 16:28:02,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 16:28:02,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 16:28:02,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 16:28:02,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 16:28:02,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 16:28:02,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 16:28:02,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 16:28:02,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 16:28:02,450 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 16:28:02,450 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 16:28:02,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 16:28:02,450 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 16:28:02,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 [2021-12-21 16:28:02,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 16:28:02,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 16:28:02,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 16:28:02,688 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 16:28:02,689 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 16:28:02,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2021-12-21 16:28:02,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c7b43fc6/7e39c296163b40b5be850828a6a8b0ac/FLAGd3026197e [2021-12-21 16:28:03,258 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 16:28:03,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2021-12-21 16:28:03,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c7b43fc6/7e39c296163b40b5be850828a6a8b0ac/FLAGd3026197e [2021-12-21 16:28:03,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c7b43fc6/7e39c296163b40b5be850828a6a8b0ac [2021-12-21 16:28:03,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 16:28:03,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 16:28:03,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 16:28:03,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 16:28:03,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 16:28:03,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 04:28:03" (1/1) ... [2021-12-21 16:28:03,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4785de7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:03, skipping insertion in model container [2021-12-21 16:28:03,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 04:28:03" (1/1) ... [2021-12-21 16:28:03,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 16:28:03,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 16:28:04,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2021-12-21 16:28:04,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 16:28:04,178 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 16:28:04,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2021-12-21 16:28:04,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 16:28:04,352 INFO L208 MainTranslator]: Completed translation [2021-12-21 16:28:04,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04 WrapperNode [2021-12-21 16:28:04,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 16:28:04,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 16:28:04,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 16:28:04,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 16:28:04,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (1/1) ... [2021-12-21 16:28:04,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (1/1) ... [2021-12-21 16:28:04,414 INFO L137 Inliner]: procedures = 68, calls = 170, calls flagged for inlining = 22, calls inlined = 15, statements flattened = 343 [2021-12-21 16:28:04,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 16:28:04,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 16:28:04,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 16:28:04,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 16:28:04,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (1/1) ... [2021-12-21 16:28:04,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (1/1) ... [2021-12-21 16:28:04,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (1/1) ... [2021-12-21 16:28:04,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (1/1) ... [2021-12-21 16:28:04,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (1/1) ... [2021-12-21 16:28:04,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (1/1) ... [2021-12-21 16:28:04,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (1/1) ... [2021-12-21 16:28:04,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 16:28:04,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 16:28:04,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 16:28:04,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 16:28:04,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (1/1) ... [2021-12-21 16:28:04,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 16:28:04,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 16:28:04,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 16:28:04,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 16:28:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 16:28:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 16:28:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-21 16:28:04,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-21 16:28:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 16:28:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-21 16:28:04,566 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-21 16:28:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 16:28:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2021-12-21 16:28:04,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2021-12-21 16:28:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 16:28:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 16:28:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-12-21 16:28:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-12-21 16:28:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-12-21 16:28:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-12-21 16:28:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-21 16:28:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-21 16:28:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 16:28:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 16:28:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 16:28:04,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 16:28:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2021-12-21 16:28:04,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2021-12-21 16:28:04,764 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 16:28:04,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 16:28:04,815 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-21 16:28:05,032 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 16:28:05,037 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 16:28:05,038 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 16:28:05,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:28:05 BoogieIcfgContainer [2021-12-21 16:28:05,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 16:28:05,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 16:28:05,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 16:28:05,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 16:28:05,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 04:28:03" (1/3) ... [2021-12-21 16:28:05,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b16d28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 04:28:05, skipping insertion in model container [2021-12-21 16:28:05,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:28:04" (2/3) ... [2021-12-21 16:28:05,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b16d28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 04:28:05, skipping insertion in model container [2021-12-21 16:28:05,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:28:05" (3/3) ... [2021-12-21 16:28:05,046 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2021-12-21 16:28:05,050 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 16:28:05,051 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 16:28:05,089 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 16:28:05,093 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 16:28:05,094 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 16:28:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 77 states have internal predecessors, (99), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-21 16:28:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 16:28:05,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:05,114 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:05,114 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1422532354, now seen corresponding path program 1 times [2021-12-21 16:28:05,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:05,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397722133] [2021-12-21 16:28:05,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:05,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 16:28:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 16:28:05,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:05,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397722133] [2021-12-21 16:28:05,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397722133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:05,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 16:28:05,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 16:28:05,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923782423] [2021-12-21 16:28:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:05,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 16:28:05,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:05,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 16:28:05,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 16:28:05,644 INFO L87 Difference]: Start difference. First operand has 91 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 77 states have internal predecessors, (99), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-21 16:28:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:05,797 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2021-12-21 16:28:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 16:28:05,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2021-12-21 16:28:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:05,811 INFO L225 Difference]: With dead ends: 181 [2021-12-21 16:28:05,811 INFO L226 Difference]: Without dead ends: 85 [2021-12-21 16:28:05,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-21 16:28:05,819 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 32 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:05,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 266 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 16:28:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-21 16:28:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2021-12-21 16:28:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 67 states have internal predecessors, (88), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 16:28:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2021-12-21 16:28:05,870 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 61 [2021-12-21 16:28:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:05,870 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2021-12-21 16:28:05,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-21 16:28:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2021-12-21 16:28:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 16:28:05,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:05,877 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:05,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 16:28:05,878 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash 147371386, now seen corresponding path program 1 times [2021-12-21 16:28:05,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:05,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906039741] [2021-12-21 16:28:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:05,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 16:28:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 16:28:06,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:06,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906039741] [2021-12-21 16:28:06,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906039741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:06,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 16:28:06,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 16:28:06,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363562973] [2021-12-21 16:28:06,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:06,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 16:28:06,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:06,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 16:28:06,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 16:28:06,036 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:06,148 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2021-12-21 16:28:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 16:28:06,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2021-12-21 16:28:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:06,150 INFO L225 Difference]: With dead ends: 179 [2021-12-21 16:28:06,151 INFO L226 Difference]: Without dead ends: 128 [2021-12-21 16:28:06,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-21 16:28:06,152 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:06,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 376 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 16:28:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-21 16:28:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2021-12-21 16:28:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.375) internal successors, (143), 105 states have internal predecessors, (143), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-21 16:28:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2021-12-21 16:28:06,161 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 61 [2021-12-21 16:28:06,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:06,161 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2021-12-21 16:28:06,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2021-12-21 16:28:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-21 16:28:06,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:06,163 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:06,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 16:28:06,163 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:06,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash 668155054, now seen corresponding path program 1 times [2021-12-21 16:28:06,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:06,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123469061] [2021-12-21 16:28:06,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:06,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 16:28:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 16:28:06,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:06,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123469061] [2021-12-21 16:28:06,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123469061] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:06,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 16:28:06,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 16:28:06,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375325451] [2021-12-21 16:28:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:06,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 16:28:06,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:06,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 16:28:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 16:28:06,323 INFO L87 Difference]: Start difference. First operand 121 states and 161 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:06,400 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2021-12-21 16:28:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 16:28:06,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2021-12-21 16:28:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:06,403 INFO L225 Difference]: With dead ends: 135 [2021-12-21 16:28:06,403 INFO L226 Difference]: Without dead ends: 130 [2021-12-21 16:28:06,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-21 16:28:06,405 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 126 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:06,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 249 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 16:28:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-21 16:28:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2021-12-21 16:28:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 105 states have internal predecessors, (142), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-21 16:28:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 160 transitions. [2021-12-21 16:28:06,429 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 160 transitions. Word has length 64 [2021-12-21 16:28:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:06,430 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 160 transitions. [2021-12-21 16:28:06,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 160 transitions. [2021-12-21 16:28:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-21 16:28:06,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:06,433 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:06,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 16:28:06,433 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:06,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash 725413356, now seen corresponding path program 1 times [2021-12-21 16:28:06,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:06,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246442137] [2021-12-21 16:28:06,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:06,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 16:28:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 16:28:06,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:06,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246442137] [2021-12-21 16:28:06,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246442137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:06,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 16:28:06,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 16:28:06,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469955956] [2021-12-21 16:28:06,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:06,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 16:28:06,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 16:28:06,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 16:28:06,581 INFO L87 Difference]: Start difference. First operand 121 states and 160 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-21 16:28:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:06,678 INFO L93 Difference]: Finished difference Result 304 states and 419 transitions. [2021-12-21 16:28:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 16:28:06,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2021-12-21 16:28:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:06,680 INFO L225 Difference]: With dead ends: 304 [2021-12-21 16:28:06,681 INFO L226 Difference]: Without dead ends: 209 [2021-12-21 16:28:06,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-21 16:28:06,687 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 115 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:06,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 362 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 16:28:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-21 16:28:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2021-12-21 16:28:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 180 states have (on average 1.3944444444444444) internal successors, (251), 181 states have internal predecessors, (251), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-21 16:28:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2021-12-21 16:28:06,701 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 64 [2021-12-21 16:28:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:06,702 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2021-12-21 16:28:06,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-21 16:28:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2021-12-21 16:28:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-21 16:28:06,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:06,705 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:06,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 16:28:06,705 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:06,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:06,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1104607523, now seen corresponding path program 1 times [2021-12-21 16:28:06,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:06,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494544317] [2021-12-21 16:28:06,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:06,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 16:28:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 16:28:06,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494544317] [2021-12-21 16:28:06,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494544317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:06,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 16:28:06,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 16:28:06,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567753155] [2021-12-21 16:28:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:06,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 16:28:06,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:06,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 16:28:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 16:28:06,824 INFO L87 Difference]: Start difference. First operand 201 states and 273 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:06,906 INFO L93 Difference]: Finished difference Result 443 states and 613 transitions. [2021-12-21 16:28:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 16:28:06,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 70 [2021-12-21 16:28:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:06,908 INFO L225 Difference]: With dead ends: 443 [2021-12-21 16:28:06,908 INFO L226 Difference]: Without dead ends: 272 [2021-12-21 16:28:06,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-21 16:28:06,909 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:06,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 248 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 16:28:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-21 16:28:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2021-12-21 16:28:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 240 states have (on average 1.3958333333333333) internal successors, (335), 241 states have internal predecessors, (335), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-21 16:28:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2021-12-21 16:28:06,916 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 70 [2021-12-21 16:28:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:06,917 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2021-12-21 16:28:06,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2021-12-21 16:28:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-21 16:28:06,918 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:06,918 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:06,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 16:28:06,918 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:06,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash -49701621, now seen corresponding path program 1 times [2021-12-21 16:28:06,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:06,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400968746] [2021-12-21 16:28:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:06,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-21 16:28:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 16:28:07,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:07,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400968746] [2021-12-21 16:28:07,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400968746] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 16:28:07,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698075224] [2021-12-21 16:28:07,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:07,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 16:28:07,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 16:28:07,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 16:28:07,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 16:28:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 16:28:07,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 16:28:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 16:28:07,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 16:28:07,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698075224] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:07,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 16:28:07,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2021-12-21 16:28:07,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956375286] [2021-12-21 16:28:07,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:07,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 16:28:07,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:07,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 16:28:07,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-21 16:28:07,439 INFO L87 Difference]: Start difference. First operand 261 states and 357 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-21 16:28:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:07,459 INFO L93 Difference]: Finished difference Result 504 states and 696 transitions. [2021-12-21 16:28:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 16:28:07,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 81 [2021-12-21 16:28:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:07,461 INFO L225 Difference]: With dead ends: 504 [2021-12-21 16:28:07,461 INFO L226 Difference]: Without dead ends: 262 [2021-12-21 16:28:07,461 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-12-21 16:28:07,462 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 3 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:07,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 301 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 16:28:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-21 16:28:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-12-21 16:28:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 242 states have internal predecessors, (336), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-21 16:28:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2021-12-21 16:28:07,469 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 81 [2021-12-21 16:28:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:07,470 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2021-12-21 16:28:07,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-21 16:28:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2021-12-21 16:28:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-21 16:28:07,471 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:07,471 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:07,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 16:28:07,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-21 16:28:07,689 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:07,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:07,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1260616323, now seen corresponding path program 1 times [2021-12-21 16:28:07,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:07,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041241421] [2021-12-21 16:28:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:07,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-21 16:28:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 16:28:07,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:07,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041241421] [2021-12-21 16:28:07,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041241421] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 16:28:07,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225221439] [2021-12-21 16:28:07,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:07,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 16:28:07,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 16:28:07,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 16:28:07,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 16:28:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 16:28:08,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 16:28:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-21 16:28:08,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 16:28:08,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225221439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:08,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 16:28:08,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-12-21 16:28:08,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596091741] [2021-12-21 16:28:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:08,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 16:28:08,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 16:28:08,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-21 16:28:08,185 INFO L87 Difference]: Start difference. First operand 262 states and 358 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:08,217 INFO L93 Difference]: Finished difference Result 825 states and 1152 transitions. [2021-12-21 16:28:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 16:28:08,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 83 [2021-12-21 16:28:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:08,220 INFO L225 Difference]: With dead ends: 825 [2021-12-21 16:28:08,220 INFO L226 Difference]: Without dead ends: 594 [2021-12-21 16:28:08,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-21 16:28:08,221 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 224 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:08,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 496 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 16:28:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-12-21 16:28:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 268. [2021-12-21 16:28:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 247 states have (on average 1.3765182186234817) internal successors, (340), 248 states have internal predecessors, (340), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-21 16:28:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 362 transitions. [2021-12-21 16:28:08,242 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 362 transitions. Word has length 83 [2021-12-21 16:28:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:08,242 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 362 transitions. [2021-12-21 16:28:08,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 362 transitions. [2021-12-21 16:28:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-21 16:28:08,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:08,243 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:08,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 16:28:08,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-21 16:28:08,443 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:08,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:08,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1940674693, now seen corresponding path program 1 times [2021-12-21 16:28:08,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:08,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596964919] [2021-12-21 16:28:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:08,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-21 16:28:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 16:28:08,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:08,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596964919] [2021-12-21 16:28:08,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596964919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 16:28:08,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369185018] [2021-12-21 16:28:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:08,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 16:28:08,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 16:28:08,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 16:28:08,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 16:28:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:08,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 16:28:08,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 16:28:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-21 16:28:08,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 16:28:08,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369185018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:08,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 16:28:08,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-21 16:28:08,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221633044] [2021-12-21 16:28:08,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:08,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 16:28:08,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:08,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 16:28:08,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 16:28:08,808 INFO L87 Difference]: Start difference. First operand 268 states and 362 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:08,835 INFO L93 Difference]: Finished difference Result 643 states and 888 transitions. [2021-12-21 16:28:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 16:28:08,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 83 [2021-12-21 16:28:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:08,837 INFO L225 Difference]: With dead ends: 643 [2021-12-21 16:28:08,837 INFO L226 Difference]: Without dead ends: 406 [2021-12-21 16:28:08,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 16:28:08,838 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 39 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:08,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 16:28:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-12-21 16:28:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 255. [2021-12-21 16:28:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 238 states have (on average 1.3739495798319328) internal successors, (327), 239 states have internal predecessors, (327), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-21 16:28:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 345 transitions. [2021-12-21 16:28:08,848 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 345 transitions. Word has length 83 [2021-12-21 16:28:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:08,849 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 345 transitions. [2021-12-21 16:28:08,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 345 transitions. [2021-12-21 16:28:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-21 16:28:08,850 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:08,850 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:08,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 16:28:09,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 16:28:09,068 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash 587922057, now seen corresponding path program 1 times [2021-12-21 16:28:09,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:09,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22531214] [2021-12-21 16:28:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:09,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-21 16:28:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-21 16:28:09,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:09,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22531214] [2021-12-21 16:28:09,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22531214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:09,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 16:28:09,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 16:28:09,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117298378] [2021-12-21 16:28:09,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:09,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 16:28:09,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:09,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 16:28:09,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 16:28:09,217 INFO L87 Difference]: Start difference. First operand 255 states and 345 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-21 16:28:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:09,353 INFO L93 Difference]: Finished difference Result 384 states and 524 transitions. [2021-12-21 16:28:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 16:28:09,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 85 [2021-12-21 16:28:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:09,357 INFO L225 Difference]: With dead ends: 384 [2021-12-21 16:28:09,357 INFO L226 Difference]: Without dead ends: 381 [2021-12-21 16:28:09,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-21 16:28:09,359 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 137 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:09,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 622 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 16:28:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-21 16:28:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 374. [2021-12-21 16:28:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.388101983002833) internal successors, (490), 354 states have internal predecessors, (490), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-21 16:28:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 514 transitions. [2021-12-21 16:28:09,373 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 514 transitions. Word has length 85 [2021-12-21 16:28:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:09,374 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 514 transitions. [2021-12-21 16:28:09,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-21 16:28:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 514 transitions. [2021-12-21 16:28:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-21 16:28:09,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:09,375 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:09,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 16:28:09,375 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash 138660115, now seen corresponding path program 1 times [2021-12-21 16:28:09,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:09,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162032373] [2021-12-21 16:28:09,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:09,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-21 16:28:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-21 16:28:09,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:09,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162032373] [2021-12-21 16:28:09,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162032373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:09,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 16:28:09,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 16:28:09,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790210032] [2021-12-21 16:28:09,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:09,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 16:28:09,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:09,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 16:28:09,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 16:28:09,496 INFO L87 Difference]: Start difference. First operand 374 states and 514 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:09,576 INFO L93 Difference]: Finished difference Result 773 states and 1076 transitions. [2021-12-21 16:28:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 16:28:09,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2021-12-21 16:28:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:09,578 INFO L225 Difference]: With dead ends: 773 [2021-12-21 16:28:09,579 INFO L226 Difference]: Without dead ends: 525 [2021-12-21 16:28:09,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-21 16:28:09,580 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:09,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 545 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 16:28:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-12-21 16:28:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 374. [2021-12-21 16:28:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3767705382436262) internal successors, (486), 354 states have internal predecessors, (486), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-21 16:28:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 510 transitions. [2021-12-21 16:28:09,595 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 510 transitions. Word has length 92 [2021-12-21 16:28:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:09,596 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 510 transitions. [2021-12-21 16:28:09,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 510 transitions. [2021-12-21 16:28:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-21 16:28:09,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:09,597 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:09,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 16:28:09,597 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:09,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash -882408239, now seen corresponding path program 1 times [2021-12-21 16:28:09,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:09,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958697717] [2021-12-21 16:28:09,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:09,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-21 16:28:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-21 16:28:09,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:09,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958697717] [2021-12-21 16:28:09,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958697717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:09,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 16:28:09,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 16:28:09,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510497796] [2021-12-21 16:28:09,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:09,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 16:28:09,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:09,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 16:28:09,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 16:28:09,749 INFO L87 Difference]: Start difference. First operand 374 states and 510 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:09,873 INFO L93 Difference]: Finished difference Result 940 states and 1311 transitions. [2021-12-21 16:28:09,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 16:28:09,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2021-12-21 16:28:09,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:09,875 INFO L225 Difference]: With dead ends: 940 [2021-12-21 16:28:09,876 INFO L226 Difference]: Without dead ends: 692 [2021-12-21 16:28:09,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-21 16:28:09,877 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 245 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:09,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 742 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 16:28:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-12-21 16:28:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 374. [2021-12-21 16:28:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3654390934844192) internal successors, (482), 354 states have internal predecessors, (482), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-21 16:28:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 506 transitions. [2021-12-21 16:28:09,891 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 506 transitions. Word has length 92 [2021-12-21 16:28:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:09,891 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 506 transitions. [2021-12-21 16:28:09,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-21 16:28:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 506 transitions. [2021-12-21 16:28:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-21 16:28:09,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:09,893 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:09,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 16:28:09,893 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:09,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2027716343, now seen corresponding path program 1 times [2021-12-21 16:28:09,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:09,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029427602] [2021-12-21 16:28:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:09,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:09,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:10,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-21 16:28:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:10,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-21 16:28:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-21 16:28:10,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:10,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029427602] [2021-12-21 16:28:10,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029427602] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 16:28:10,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024278252] [2021-12-21 16:28:10,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:10,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 16:28:10,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 16:28:10,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 16:28:10,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 16:28:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:10,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 16:28:10,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 16:28:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 16:28:10,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 16:28:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-21 16:28:10,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024278252] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 16:28:10,662 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 16:28:10,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-21 16:28:10,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539443449] [2021-12-21 16:28:10,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 16:28:10,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 16:28:10,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 16:28:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-21 16:28:10,664 INFO L87 Difference]: Start difference. First operand 374 states and 506 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-21 16:28:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:10,857 INFO L93 Difference]: Finished difference Result 739 states and 1006 transitions. [2021-12-21 16:28:10,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 16:28:10,858 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2021-12-21 16:28:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:10,859 INFO L225 Difference]: With dead ends: 739 [2021-12-21 16:28:10,859 INFO L226 Difference]: Without dead ends: 381 [2021-12-21 16:28:10,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-12-21 16:28:10,861 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 77 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:10,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 382 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 16:28:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-21 16:28:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-12-21 16:28:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 358 states have (on average 1.3603351955307263) internal successors, (487), 361 states have internal predecessors, (487), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2021-12-21 16:28:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 513 transitions. [2021-12-21 16:28:10,875 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 513 transitions. Word has length 99 [2021-12-21 16:28:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:10,875 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 513 transitions. [2021-12-21 16:28:10,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-21 16:28:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 513 transitions. [2021-12-21 16:28:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-21 16:28:10,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:10,877 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:10,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 16:28:11,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 16:28:11,095 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1894269569, now seen corresponding path program 2 times [2021-12-21 16:28:11,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:11,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083191963] [2021-12-21 16:28:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:11,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 16:28:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-21 16:28:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-21 16:28:11,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:11,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083191963] [2021-12-21 16:28:11,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083191963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:11,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 16:28:11,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 16:28:11,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576536487] [2021-12-21 16:28:11,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:11,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 16:28:11,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:11,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 16:28:11,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-21 16:28:11,278 INFO L87 Difference]: Start difference. First operand 381 states and 513 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-21 16:28:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:11,461 INFO L93 Difference]: Finished difference Result 964 states and 1323 transitions. [2021-12-21 16:28:11,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 16:28:11,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2021-12-21 16:28:11,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:11,464 INFO L225 Difference]: With dead ends: 964 [2021-12-21 16:28:11,464 INFO L226 Difference]: Without dead ends: 617 [2021-12-21 16:28:11,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-21 16:28:11,465 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.1s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:11,465 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.1s Time] [2021-12-21 16:28:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-12-21 16:28:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 393. [2021-12-21 16:28:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 370 states have (on average 1.3486486486486486) internal successors, (499), 373 states have internal predecessors, (499), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2021-12-21 16:28:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 525 transitions. [2021-12-21 16:28:11,482 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 525 transitions. Word has length 105 [2021-12-21 16:28:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:11,482 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 525 transitions. [2021-12-21 16:28:11,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-21 16:28:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 525 transitions. [2021-12-21 16:28:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-21 16:28:11,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:11,483 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:11,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 16:28:11,484 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1192669695, now seen corresponding path program 1 times [2021-12-21 16:28:11,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:11,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247417599] [2021-12-21 16:28:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:11,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:11,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:12,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 16:28:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:12,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-21 16:28:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-21 16:28:12,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:12,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247417599] [2021-12-21 16:28:12,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247417599] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 16:28:12,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542664912] [2021-12-21 16:28:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:12,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 16:28:12,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 16:28:12,386 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 16:28:12,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 16:28:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:12,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-21 16:28:12,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 16:28:12,974 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 16:28:12,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 72 [2021-12-21 16:28:12,985 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 16:28:12,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 51 [2021-12-21 16:28:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-21 16:28:13,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 16:28:13,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542664912] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:13,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 16:28:13,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [23] total 28 [2021-12-21 16:28:13,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374102238] [2021-12-21 16:28:13,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:13,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 16:28:13,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:13,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 16:28:13,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2021-12-21 16:28:13,117 INFO L87 Difference]: Start difference. First operand 393 states and 525 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-21 16:28:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:13,290 INFO L93 Difference]: Finished difference Result 870 states and 1171 transitions. [2021-12-21 16:28:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 16:28:13,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2021-12-21 16:28:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:13,292 INFO L225 Difference]: With dead ends: 870 [2021-12-21 16:28:13,293 INFO L226 Difference]: Without dead ends: 602 [2021-12-21 16:28:13,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2021-12-21 16:28:13,294 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 204 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:13,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 16:28:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-12-21 16:28:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 284. [2021-12-21 16:28:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 265 states have (on average 1.3132075471698113) internal successors, (348), 266 states have internal predecessors, (348), 12 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-21 16:28:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 370 transitions. [2021-12-21 16:28:13,312 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 370 transitions. Word has length 105 [2021-12-21 16:28:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:13,312 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 370 transitions. [2021-12-21 16:28:13,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-21 16:28:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 370 transitions. [2021-12-21 16:28:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-21 16:28:13,314 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:13,314 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:13,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 16:28:13,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-21 16:28:13,535 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1062893161, now seen corresponding path program 1 times [2021-12-21 16:28:13,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:13,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090796911] [2021-12-21 16:28:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:13,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 16:28:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-21 16:28:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-21 16:28:13,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:13,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090796911] [2021-12-21 16:28:13,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090796911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:13,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 16:28:13,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 16:28:13,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088986673] [2021-12-21 16:28:13,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:13,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 16:28:13,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:13,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 16:28:13,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-21 16:28:13,722 INFO L87 Difference]: Start difference. First operand 284 states and 370 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 16:28:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:13,869 INFO L93 Difference]: Finished difference Result 286 states and 371 transitions. [2021-12-21 16:28:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 16:28:13,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 107 [2021-12-21 16:28:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:13,871 INFO L225 Difference]: With dead ends: 286 [2021-12-21 16:28:13,871 INFO L226 Difference]: Without dead ends: 279 [2021-12-21 16:28:13,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-12-21 16:28:13,873 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 226 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:13,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 342 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 16:28:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-21 16:28:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2021-12-21 16:28:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 11 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-21 16:28:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 361 transitions. [2021-12-21 16:28:13,891 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 361 transitions. Word has length 107 [2021-12-21 16:28:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:13,891 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 361 transitions. [2021-12-21 16:28:13,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 16:28:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 361 transitions. [2021-12-21 16:28:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-21 16:28:13,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 16:28:13,892 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:13,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 16:28:13,893 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 16:28:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 16:28:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1411237866, now seen corresponding path program 1 times [2021-12-21 16:28:13,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 16:28:13,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799154761] [2021-12-21 16:28:13,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:13,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 16:28:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 16:28:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 16:28:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 16:28:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:14,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 16:28:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:14,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 16:28:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 16:28:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-21 16:28:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-21 16:28:14,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 16:28:14,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799154761] [2021-12-21 16:28:14,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799154761] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 16:28:14,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966243802] [2021-12-21 16:28:14,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 16:28:14,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 16:28:14,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 16:28:14,042 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 16:28:14,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 16:28:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 16:28:14,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 16:28:14,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 16:28:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-21 16:28:14,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 16:28:14,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966243802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 16:28:14,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 16:28:14,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2021-12-21 16:28:14,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095344637] [2021-12-21 16:28:14,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 16:28:14,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 16:28:14,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 16:28:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 16:28:14,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 16:28:14,422 INFO L87 Difference]: Start difference. First operand 279 states and 361 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-21 16:28:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 16:28:14,477 INFO L93 Difference]: Finished difference Result 279 states and 361 transitions. [2021-12-21 16:28:14,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 16:28:14,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 118 [2021-12-21 16:28:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 16:28:14,478 INFO L225 Difference]: With dead ends: 279 [2021-12-21 16:28:14,478 INFO L226 Difference]: Without dead ends: 0 [2021-12-21 16:28:14,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 16:28:14,478 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 73 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 16:28:14,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 162 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 16:28:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-21 16:28:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-21 16:28:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 16:28:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-21 16:28:14,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2021-12-21 16:28:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 16:28:14,480 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-21 16:28:14,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-21 16:28:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-21 16:28:14,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-21 16:28:14,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 16:28:14,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 16:28:14,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-21 16:28:14,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-21 16:28:16,619 INFO L858 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5894 5904) no Hoare annotation was computed. [2021-12-21 16:28:16,625 INFO L854 garLoopResultBuilder]: At program point L5899(line 5899) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2021-12-21 16:28:16,625 INFO L858 garLoopResultBuilder]: For program point L5899-1(line 5899) no Hoare annotation was computed. [2021-12-21 16:28:16,625 INFO L861 garLoopResultBuilder]: At program point L5901(line 5901) the Hoare annotation is: true [2021-12-21 16:28:16,625 INFO L858 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5894 5904) no Hoare annotation was computed. [2021-12-21 16:28:16,625 INFO L858 garLoopResultBuilder]: For program point L5901-1(line 5901) no Hoare annotation was computed. [2021-12-21 16:28:16,625 INFO L854 garLoopResultBuilder]: At program point ldv_init_zallocENTRY(lines 5894 5904) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) [2021-12-21 16:28:16,626 INFO L858 garLoopResultBuilder]: For program point L5858-2(lines 5857 5859) no Hoare annotation was computed. [2021-12-21 16:28:16,626 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5857 5859) the Hoare annotation is: true [2021-12-21 16:28:16,626 INFO L858 garLoopResultBuilder]: For program point L5858(line 5858) no Hoare annotation was computed. [2021-12-21 16:28:16,626 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5857 5859) no Hoare annotation was computed. [2021-12-21 16:28:16,627 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6260 6266) no Hoare annotation was computed. [2021-12-21 16:28:16,627 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6260 6266) the Hoare annotation is: true [2021-12-21 16:28:16,627 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2021-12-21 16:28:16,627 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6260 6266) no Hoare annotation was computed. [2021-12-21 16:28:16,627 INFO L858 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5929 5935) no Hoare annotation was computed. [2021-12-21 16:28:16,627 INFO L861 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5929 5935) the Hoare annotation is: true [2021-12-21 16:28:16,627 INFO L858 garLoopResultBuilder]: For program point L6113-2(lines 6113 6116) no Hoare annotation was computed. [2021-12-21 16:28:16,627 INFO L858 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2021-12-21 16:28:16,628 INFO L854 garLoopResultBuilder]: At program point L6394(lines 6393 6395) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,628 INFO L854 garLoopResultBuilder]: At program point L6237(lines 6167 6242) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,628 INFO L858 garLoopResultBuilder]: For program point L6204(lines 6204 6209) no Hoare annotation was computed. [2021-12-21 16:28:16,628 INFO L854 garLoopResultBuilder]: At program point L6328(lines 6314 6330) the Hoare annotation is: (let ((.cse7 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) (.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse0 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse4)) (.cse1 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse3)) (.cse2 (= ~ldv_retval_0~0 0))) (or (and (= ~ldv_module_refcounter~0 1) .cse0 .cse1 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse2) (and (<= 2 ~ldv_module_refcounter~0) (not (= (mod (+ .cse3 .cse4) 18446744073709551616) 0)) .cse0 .cse1 (<= ~ldv_module_refcounter~0 2) .cse2 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1))))))) [2021-12-21 16:28:16,628 INFO L858 garLoopResultBuilder]: For program point L6320(lines 6320 6325) no Hoare annotation was computed. [2021-12-21 16:28:16,629 INFO L854 garLoopResultBuilder]: At program point L6221(lines 6167 6242) the Hoare annotation is: (= ~ldv_module_refcounter~0 1) [2021-12-21 16:28:16,629 INFO L858 garLoopResultBuilder]: For program point L6180(lines 6180 6236) no Hoare annotation was computed. [2021-12-21 16:28:16,629 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-21 16:28:16,629 INFO L858 garLoopResultBuilder]: For program point L6362(lines 6362 6365) no Hoare annotation was computed. [2021-12-21 16:28:16,629 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-21 16:28:16,630 INFO L861 garLoopResultBuilder]: At program point L6362-1(lines 6359 6368) the Hoare annotation is: true [2021-12-21 16:28:16,630 INFO L854 garLoopResultBuilder]: At program point L6255(line 6255) the Hoare annotation is: (let ((.cse4 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (not (= (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616) 0)) (<= (div |ULTIMATE.start_pppox_create_~tmp~8#1| 256) 0) (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (<= 2 ~ldv_module_refcounter~0) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (<= 1 |ULTIMATE.start_pppox_create_~tmp~8#1|) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (<= ~ldv_module_refcounter~0 2) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))) [2021-12-21 16:28:16,630 INFO L854 garLoopResultBuilder]: At program point L6255-1(lines 6252 6258) the Hoare annotation is: (let ((.cse4 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (= ~ldv_module_refcounter~0 1) (not (= (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616) 0)) (<= (div |ULTIMATE.start_pppox_create_~tmp~8#1| 256) 0) (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (<= 1 |ULTIMATE.start_pppox_create_~tmp~8#1|) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))) [2021-12-21 16:28:16,630 INFO L858 garLoopResultBuilder]: For program point L6214(lines 6214 6218) no Hoare annotation was computed. [2021-12-21 16:28:16,630 INFO L858 garLoopResultBuilder]: For program point L6181(line 6181) no Hoare annotation was computed. [2021-12-21 16:28:16,630 INFO L858 garLoopResultBuilder]: For program point L6214-2(lines 6212 6224) no Hoare annotation was computed. [2021-12-21 16:28:16,631 INFO L854 garLoopResultBuilder]: At program point L6363(line 6363) the Hoare annotation is: false [2021-12-21 16:28:16,631 INFO L854 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,631 INFO L858 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2021-12-21 16:28:16,631 INFO L858 garLoopResultBuilder]: For program point L6182(lines 6182 6197) no Hoare annotation was computed. [2021-12-21 16:28:16,631 INFO L854 garLoopResultBuilder]: At program point L6174(line 6174) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,631 INFO L854 garLoopResultBuilder]: At program point L5918(lines 5913 5920) the Hoare annotation is: (let ((.cse4 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (= ~ldv_module_refcounter~0 1) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= ~ldv_retval_0~0 0))))) [2021-12-21 16:28:16,632 INFO L858 garLoopResultBuilder]: For program point L6174-1(line 6174) no Hoare annotation was computed. [2021-12-21 16:28:16,632 INFO L858 garLoopResultBuilder]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2021-12-21 16:28:16,632 INFO L854 garLoopResultBuilder]: At program point L6397(lines 6396 6398) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,632 INFO L858 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2021-12-21 16:28:16,632 INFO L854 garLoopResultBuilder]: At program point L6133(lines 6106 6135) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,632 INFO L854 garLoopResultBuilder]: At program point L6150(lines 6146 6152) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,632 INFO L854 garLoopResultBuilder]: At program point L6249(lines 6244 6251) the Hoare annotation is: (let ((.cse7 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) (.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse0 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse4)) (.cse1 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse3)) (.cse2 (= ~ldv_retval_0~0 0))) (or (and (= ~ldv_module_refcounter~0 1) (= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 0) .cse0 .cse1 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse2) (and (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (<= 2 ~ldv_module_refcounter~0) (not (= (mod (+ .cse3 .cse4) 18446744073709551616) 0)) .cse0 .cse1 (<= ~ldv_module_refcounter~0 2) .cse2 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))))) [2021-12-21 16:28:16,633 INFO L858 garLoopResultBuilder]: For program point L6117(lines 6117 6130) no Hoare annotation was computed. [2021-12-21 16:28:16,633 INFO L861 garLoopResultBuilder]: At program point L6241(lines 6156 6243) the Hoare annotation is: true [2021-12-21 16:28:16,633 INFO L854 garLoopResultBuilder]: At program point L6134(lines 6101 6136) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,634 INFO L858 garLoopResultBuilder]: For program point L6200(lines 6200 6232) no Hoare annotation was computed. [2021-12-21 16:28:16,634 INFO L858 garLoopResultBuilder]: For program point L6192(line 6192) no Hoare annotation was computed. [2021-12-21 16:28:16,635 INFO L858 garLoopResultBuilder]: For program point L6184(lines 6184 6194) no Hoare annotation was computed. [2021-12-21 16:28:16,635 INFO L854 garLoopResultBuilder]: At program point L6143(lines 6138 6145) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,635 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-21 16:28:16,635 INFO L858 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-12-21 16:28:16,635 INFO L858 garLoopResultBuilder]: For program point L6234(line 6234) no Hoare annotation was computed. [2021-12-21 16:28:16,636 INFO L858 garLoopResultBuilder]: For program point L6168-1(line 6168) no Hoare annotation was computed. [2021-12-21 16:28:16,636 INFO L854 garLoopResultBuilder]: At program point L6168(line 6168) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,636 INFO L861 garLoopResultBuilder]: At program point L6193(line 6193) the Hoare annotation is: true [2021-12-21 16:28:16,636 INFO L858 garLoopResultBuilder]: For program point L6185(line 6185) no Hoare annotation was computed. [2021-12-21 16:28:16,636 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-21 16:28:16,636 INFO L861 garLoopResultBuilder]: At program point L6235(line 6235) the Hoare annotation is: true [2021-12-21 16:28:16,636 INFO L858 garLoopResultBuilder]: For program point L6202(lines 6202 6229) no Hoare annotation was computed. [2021-12-21 16:28:16,636 INFO L858 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2021-12-21 16:28:16,636 INFO L858 garLoopResultBuilder]: For program point L6318(lines 6318 6327) no Hoare annotation was computed. [2021-12-21 16:28:16,637 INFO L858 garLoopResultBuilder]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2021-12-21 16:28:16,637 INFO L858 garLoopResultBuilder]: For program point L6211(line 6211) no Hoare annotation was computed. [2021-12-21 16:28:16,637 INFO L858 garLoopResultBuilder]: For program point L6203(line 6203) no Hoare annotation was computed. [2021-12-21 16:28:16,637 INFO L854 garLoopResultBuilder]: At program point L6170(line 6170) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,637 INFO L858 garLoopResultBuilder]: For program point L6170-1(line 6170) no Hoare annotation was computed. [2021-12-21 16:28:16,637 INFO L861 garLoopResultBuilder]: At program point L6228(line 6228) the Hoare annotation is: true [2021-12-21 16:28:16,637 INFO L858 garLoopResultBuilder]: For program point L6121-2(lines 6119 6130) no Hoare annotation was computed. [2021-12-21 16:28:16,637 INFO L858 garLoopResultBuilder]: For program point L6121(lines 6121 6125) no Hoare annotation was computed. [2021-12-21 16:28:16,637 INFO L854 garLoopResultBuilder]: At program point L6377(lines 6376 6378) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-12-21 16:28:16,638 INFO L858 garLoopResultBuilder]: For program point L6212(lines 6212 6225) no Hoare annotation was computed. [2021-12-21 16:28:16,638 INFO L858 garLoopResultBuilder]: For program point L6334(lines 6334 6341) no Hoare annotation was computed. [2021-12-21 16:28:16,638 INFO L858 garLoopResultBuilder]: For program point L6335-1(lines 6335 6338) no Hoare annotation was computed. [2021-12-21 16:28:16,638 INFO L858 garLoopResultBuilder]: For program point L6335(lines 6335 6338) no Hoare annotation was computed. [2021-12-21 16:28:16,638 INFO L854 garLoopResultBuilder]: At program point L6336(line 6336) the Hoare annotation is: (or (not (<= |old(~ldv_module_refcounter~0)| 2)) (not (= ~ldv_retval_0~0 0)) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2021-12-21 16:28:16,638 INFO L858 garLoopResultBuilder]: For program point L6334-2(lines 6331 6344) no Hoare annotation was computed. [2021-12-21 16:28:16,638 INFO L854 garLoopResultBuilder]: At program point ldv_module_putENTRY(lines 6331 6344) the Hoare annotation is: (or (not (<= |old(~ldv_module_refcounter~0)| 2)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= ~ldv_retval_0~0 0)) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2021-12-21 16:28:16,638 INFO L858 garLoopResultBuilder]: For program point ldv_module_putEXIT(lines 6331 6344) no Hoare annotation was computed. [2021-12-21 16:28:16,638 INFO L858 garLoopResultBuilder]: For program point ldv_memsetFINAL(lines 5905 5912) no Hoare annotation was computed. [2021-12-21 16:28:16,639 INFO L861 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-12-21 16:28:16,639 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-12-21 16:28:16,639 INFO L854 garLoopResultBuilder]: At program point ldv_memsetENTRY(lines 5905 5912) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2021-12-21 16:28:16,640 INFO L858 garLoopResultBuilder]: For program point ldv_memsetEXIT(lines 5905 5912) no Hoare annotation was computed. [2021-12-21 16:28:16,640 INFO L854 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2021-12-21 16:28:16,640 INFO L858 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2021-12-21 16:28:16,640 INFO L858 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2021-12-21 16:28:16,643 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 16:28:16,644 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 16:28:16,654 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,689 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,689 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 04:28:16 BoogieIcfgContainer [2021-12-21 16:28:16,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 16:28:16,711 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 16:28:16,711 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 16:28:16,711 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 16:28:16,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:28:05" (3/4) ... [2021-12-21 16:28:16,713 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-21 16:28:16,717 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2021-12-21 16:28:16,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2021-12-21 16:28:16,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2021-12-21 16:28:16,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2021-12-21 16:28:16,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-21 16:28:16,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2021-12-21 16:28:16,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2021-12-21 16:28:16,723 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2021-12-21 16:28:16,724 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-21 16:28:16,724 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-21 16:28:16,725 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-21 16:28:16,741 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_module_refcounter == 1 && !((ldv_func_arg1 + ldv_func_arg1) % 18446744073709551616 == 0)) && tmp / 256 <= 0) && \result <= 1) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && 1 <= tmp) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && tmp___0 == 0) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result [2021-12-21 16:28:16,741 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_module_refcounter == 1 && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((2 <= ldv_module_refcounter && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) [2021-12-21 16:28:16,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_module_refcounter == 1 && \result == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((((\result <= 1 && 2 <= ldv_module_refcounter) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result) [2021-12-21 16:28:16,765 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 16:28:16,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 16:28:16,765 INFO L158 Benchmark]: Toolchain (without parser) took 13253.34ms. Allocated memory was 104.9MB in the beginning and 306.2MB in the end (delta: 201.3MB). Free memory was 70.0MB in the beginning and 91.7MB in the end (delta: -21.8MB). Peak memory consumption was 180.6MB. Max. memory is 16.1GB. [2021-12-21 16:28:16,766 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 16:28:16,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 840.06ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 69.5MB in the beginning and 58.9MB in the end (delta: 10.7MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2021-12-21 16:28:16,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.44ms. Allocated memory is still 127.9MB. Free memory was 58.9MB in the beginning and 55.2MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 16:28:16,766 INFO L158 Benchmark]: Boogie Preprocessor took 89.48ms. Allocated memory is still 127.9MB. Free memory was 55.2MB in the beginning and 82.0MB in the end (delta: -26.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2021-12-21 16:28:16,766 INFO L158 Benchmark]: RCFGBuilder took 534.68ms. Allocated memory is still 127.9MB. Free memory was 81.4MB in the beginning and 56.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-21 16:28:16,767 INFO L158 Benchmark]: TraceAbstraction took 11668.79ms. Allocated memory was 127.9MB in the beginning and 306.2MB in the end (delta: 178.3MB). Free memory was 55.4MB in the beginning and 103.3MB in the end (delta: -47.8MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. [2021-12-21 16:28:16,767 INFO L158 Benchmark]: Witness Printer took 54.50ms. Allocated memory is still 306.2MB. Free memory was 103.3MB in the beginning and 91.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-21 16:28:16,768 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.17ms. Allocated memory is still 104.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 840.06ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 69.5MB in the beginning and 58.9MB in the end (delta: 10.7MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.44ms. Allocated memory is still 127.9MB. Free memory was 58.9MB in the beginning and 55.2MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.48ms. Allocated memory is still 127.9MB. Free memory was 55.2MB in the beginning and 82.0MB in the end (delta: -26.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * RCFGBuilder took 534.68ms. Allocated memory is still 127.9MB. Free memory was 81.4MB in the beginning and 56.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11668.79ms. Allocated memory was 127.9MB in the beginning and 306.2MB in the end (delta: 178.3MB). Free memory was 55.4MB in the beginning and 103.3MB in the end (delta: -47.8MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. * Witness Printer took 54.50ms. Allocated memory is still 306.2MB. Free memory was 103.3MB in the beginning and 91.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6264]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1863 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1850 mSDsluCounter, 7265 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5294 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1069 IncrementalHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 1971 mSDtfsCounter, 1069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 915 SyntacticMatches, 2 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=13, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1534 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 171 PreInvPairs, 242 NumberOfFragments, 973 HoareAnnotationTreeSize, 171 FomulaSimplifications, 24915 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 35 FomulaSimplificationsInter, 47270 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1939 NumberOfCodeBlocks, 1939 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2015 ConstructedInterpolants, 0 QuantifiedInterpolants, 5452 SizeOfPredicates, 41 NumberOfNonLiveVariables, 5310 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 822/896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6244]: Loop Invariant [2021-12-21 16:28:16,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((ldv_module_refcounter == 1 && \result == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((((\result <= 1 && 2 <= ldv_module_refcounter) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result) - InvariantResult [Line: 6396]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 6146]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 6138]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_0 == 1) && ldv_retval_0 == 0 - InvariantResult [Line: 6314]: Loop Invariant [2021-12-21 16:28:16,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((ldv_module_refcounter == 1 && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((2 <= ldv_module_refcounter && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) - InvariantResult [Line: 6252]: Loop Invariant [2021-12-21 16:28:16,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,811 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,811 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,814 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,814 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,814 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,814 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((ldv_module_refcounter == 1 && !((ldv_func_arg1 + ldv_func_arg1) % 18446744073709551616 == 0)) && tmp / 256 <= 0) && \result <= 1) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && 1 <= tmp) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && tmp___0 == 0) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result - InvariantResult [Line: 6156]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6376]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_1 == 0) && ldv_retval_0 == 0 - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 - InvariantResult [Line: 6359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 6101]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 5913]: Loop Invariant [2021-12-21 16:28:16,816 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,816 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-21 16:28:16,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-21 16:28:16,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((ldv_module_refcounter == 1 && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_retval_0 == 0 - InvariantResult [Line: 5929]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6393]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_0 == 1) && ldv_retval_0 == 0 - InvariantResult [Line: 6106]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 RESULT: Ultimate proved your program to be correct! [2021-12-21 16:28:16,843 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