./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:51:01,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:51:01,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:51:01,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:51:01,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:51:01,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:51:01,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:51:01,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:51:01,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:51:01,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:51:01,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:51:01,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:51:01,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:51:01,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:51:01,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:51:01,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:51:01,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:51:01,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:51:01,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:51:01,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:51:01,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:51:01,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:51:01,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:51:01,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:51:01,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:51:01,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:51:01,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:51:01,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:51:01,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:51:01,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:51:01,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:51:01,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:51:01,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:51:01,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:51:01,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:51:01,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:51:01,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:51:01,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:51:01,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:51:01,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:51:01,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:51:01,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 13:51:01,418 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:51:01,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:51:01,419 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:51:01,419 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:51:01,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:51:01,420 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:51:01,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:51:01,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:51:01,429 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:51:01,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:51:01,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:51:01,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:51:01,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:51:01,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:51:01,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:51:01,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:51:01,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:51:01,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:51:01,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:51:01,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:51:01,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:51:01,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:51:01,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:51:01,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:51:01,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:51:01,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:51:01,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:51:01,434 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:51:01,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:51:01,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:51:01,434 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a 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 [2022-11-21 13:51:01,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:51:01,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:51:01,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:51:01,789 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:51:01,790 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:51:01,791 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/../../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 [2022-11-21 13:51:05,076 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:51:05,654 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:51:05,655 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/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 [2022-11-21 13:51:05,703 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/data/fc16f8adc/e645d4716b3a4e509248056a183b0582/FLAGa07f6b84b [2022-11-21 13:51:05,726 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/data/fc16f8adc/e645d4716b3a4e509248056a183b0582 [2022-11-21 13:51:05,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:51:05,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:51:05,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:51:05,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:51:05,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:51:05,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:51:05" (1/1) ... [2022-11-21 13:51:05,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d437d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:05, skipping insertion in model container [2022-11-21 13:51:05,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:51:05" (1/1) ... [2022-11-21 13:51:05,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:51:05,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:51:06,753 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/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] [2022-11-21 13:51:06,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:51:06,880 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:51:07,197 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/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] [2022-11-21 13:51:07,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:51:07,253 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:51:07,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07 WrapperNode [2022-11-21 13:51:07,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:51:07,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:51:07,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:51:07,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:51:07,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,376 INFO L138 Inliner]: procedures = 68, calls = 170, calls flagged for inlining = 22, calls inlined = 15, statements flattened = 343 [2022-11-21 13:51:07,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:51:07,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:51:07,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:51:07,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:51:07,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,465 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:51:07,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:51:07,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:51:07,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:51:07,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (1/1) ... [2022-11-21 13:51:07,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:51:07,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:07,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:51:07,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:51:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:51:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:51:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-21 13:51:07,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-21 13:51:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:51:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-21 13:51:07,590 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-21 13:51:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:51:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-11-21 13:51:07,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-11-21 13:51:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:51:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 13:51:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-21 13:51:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-21 13:51:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-21 13:51:07,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-21 13:51:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 13:51:07,594 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 13:51:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:51:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:51:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:51:07,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:51:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-11-21 13:51:07,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-11-21 13:51:07,977 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:51:07,980 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:51:08,064 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-21 13:51:08,458 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:51:08,467 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:51:08,467 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:51:08,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:51:08 BoogieIcfgContainer [2022-11-21 13:51:08,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:51:08,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:51:08,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:51:08,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:51:08,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:51:05" (1/3) ... [2022-11-21 13:51:08,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784f80af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:51:08, skipping insertion in model container [2022-11-21 13:51:08,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:07" (2/3) ... [2022-11-21 13:51:08,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784f80af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:51:08, skipping insertion in model container [2022-11-21 13:51:08,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:51:08" (3/3) ... [2022-11-21 13:51:08,487 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2022-11-21 13:51:08,511 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:51:08,511 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 13:51:08,597 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:51:08,606 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@732193bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:51:08,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 13:51:08,612 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) [2022-11-21 13:51:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-21 13:51:08,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:08,627 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:08,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1422532354, now seen corresponding path program 1 times [2022-11-21 13:51:08,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:08,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094561622] [2022-11-21 13:51:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:51:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 13:51:09,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:09,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094561622] [2022-11-21 13:51:09,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094561622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:09,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:09,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:51:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779993727] [2022-11-21 13:51:09,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:09,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:51:09,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:09,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:51:09,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:09,405 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) [2022-11-21 13:51:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:09,618 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2022-11-21 13:51:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:51:09,621 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 [2022-11-21 13:51:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:09,637 INFO L225 Difference]: With dead ends: 181 [2022-11-21 13:51:09,637 INFO L226 Difference]: Without dead ends: 85 [2022-11-21 13:51:09,643 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:09,647 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 34 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:09,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 248 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-21 13:51:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-11-21 13:51:09,696 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) [2022-11-21 13:51:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2022-11-21 13:51:09,700 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 61 [2022-11-21 13:51:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:09,701 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2022-11-21 13:51:09,701 INFO L496 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) [2022-11-21 13:51:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2022-11-21 13:51:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-21 13:51:09,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:09,705 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:09,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:51:09,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash 147371386, now seen corresponding path program 1 times [2022-11-21 13:51:09,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:09,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168074313] [2022-11-21 13:51:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:09,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:09,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:51:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 13:51:10,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:10,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168074313] [2022-11-21 13:51:10,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168074313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:10,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:10,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078298608] [2022-11-21 13:51:10,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:10,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:10,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:10,071 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) [2022-11-21 13:51:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:10,426 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2022-11-21 13:51:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:51:10,427 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 [2022-11-21 13:51:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:10,429 INFO L225 Difference]: With dead ends: 179 [2022-11-21 13:51:10,430 INFO L226 Difference]: Without dead ends: 128 [2022-11-21 13:51:10,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:51:10,432 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 99 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:10,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 351 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:51:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-21 13:51:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2022-11-21 13:51:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.375) internal successors, (143), 105 states have internal predecessors, (143), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 13:51:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2022-11-21 13:51:10,465 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 61 [2022-11-21 13:51:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:10,466 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2022-11-21 13:51:10,467 INFO L496 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) [2022-11-21 13:51:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2022-11-21 13:51:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-21 13:51:10,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:10,469 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:10,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:51:10,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:10,470 INFO L85 PathProgramCache]: Analyzing trace with hash 668155054, now seen corresponding path program 1 times [2022-11-21 13:51:10,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:10,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481020846] [2022-11-21 13:51:10,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:10,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:51:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 13:51:10,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:10,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481020846] [2022-11-21 13:51:10,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481020846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:10,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:10,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:10,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558824490] [2022-11-21 13:51:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:10,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:10,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:10,796 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) [2022-11-21 13:51:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:11,024 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2022-11-21 13:51:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:51:11,025 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 [2022-11-21 13:51:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:11,029 INFO L225 Difference]: With dead ends: 135 [2022-11-21 13:51:11,033 INFO L226 Difference]: Without dead ends: 130 [2022-11-21 13:51:11,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:51:11,035 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 131 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:11,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 231 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-21 13:51:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2022-11-21 13:51:11,061 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) [2022-11-21 13:51:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 160 transitions. [2022-11-21 13:51:11,069 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 160 transitions. Word has length 64 [2022-11-21 13:51:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:11,071 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 160 transitions. [2022-11-21 13:51:11,072 INFO L496 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) [2022-11-21 13:51:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 160 transitions. [2022-11-21 13:51:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-21 13:51:11,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:11,079 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:11,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:51:11,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:11,085 INFO L85 PathProgramCache]: Analyzing trace with hash 725413356, now seen corresponding path program 1 times [2022-11-21 13:51:11,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:11,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891015611] [2022-11-21 13:51:11,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:11,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:51:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 13:51:11,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:11,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891015611] [2022-11-21 13:51:11,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891015611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:11,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:11,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:11,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971761862] [2022-11-21 13:51:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:11,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:11,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:11,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:11,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:11,448 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) [2022-11-21 13:51:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:11,685 INFO L93 Difference]: Finished difference Result 304 states and 419 transitions. [2022-11-21 13:51:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:51:11,686 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 [2022-11-21 13:51:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:11,693 INFO L225 Difference]: With dead ends: 304 [2022-11-21 13:51:11,694 INFO L226 Difference]: Without dead ends: 209 [2022-11-21 13:51:11,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:51:11,701 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 119 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:11,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 344 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:51:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-21 13:51:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2022-11-21 13:51:11,746 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) [2022-11-21 13:51:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2022-11-21 13:51:11,748 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 64 [2022-11-21 13:51:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:11,749 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2022-11-21 13:51:11,749 INFO L496 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) [2022-11-21 13:51:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2022-11-21 13:51:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-21 13:51:11,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:11,756 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:11,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:51:11,757 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1104607523, now seen corresponding path program 1 times [2022-11-21 13:51:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:11,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249447473] [2022-11-21 13:51:11,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:11,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:51:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 13:51:12,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:12,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249447473] [2022-11-21 13:51:12,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249447473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:12,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:12,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:12,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13598695] [2022-11-21 13:51:12,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:12,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:12,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:12,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:12,054 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) [2022-11-21 13:51:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:12,239 INFO L93 Difference]: Finished difference Result 443 states and 613 transitions. [2022-11-21 13:51:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:51:12,240 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 [2022-11-21 13:51:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:12,243 INFO L225 Difference]: With dead ends: 443 [2022-11-21 13:51:12,243 INFO L226 Difference]: Without dead ends: 272 [2022-11-21 13:51:12,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:51:12,246 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 109 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:12,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 228 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-21 13:51:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2022-11-21 13:51:12,294 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) [2022-11-21 13:51:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2022-11-21 13:51:12,297 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 70 [2022-11-21 13:51:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:12,300 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2022-11-21 13:51:12,300 INFO L496 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) [2022-11-21 13:51:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2022-11-21 13:51:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-21 13:51:12,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:12,304 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:12,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:51:12,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:12,305 INFO L85 PathProgramCache]: Analyzing trace with hash -49701621, now seen corresponding path program 1 times [2022-11-21 13:51:12,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:12,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054797635] [2022-11-21 13:51:12,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:51:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-21 13:51:12,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:12,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054797635] [2022-11-21 13:51:12,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054797635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:12,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520710538] [2022-11-21 13:51:12,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:12,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:12,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:12,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:12,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:51:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:13,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 13:51:13,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 13:51:13,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:51:13,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520710538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:13,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:51:13,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-11-21 13:51:13,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324991748] [2022-11-21 13:51:13,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:13,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:51:13,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:13,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:51:13,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:51:13,283 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) [2022-11-21 13:51:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:13,342 INFO L93 Difference]: Finished difference Result 504 states and 696 transitions. [2022-11-21 13:51:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:51:13,343 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 [2022-11-21 13:51:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:13,344 INFO L225 Difference]: With dead ends: 504 [2022-11-21 13:51:13,344 INFO L226 Difference]: Without dead ends: 262 [2022-11-21 13:51:13,345 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:13,346 INFO L413 NwaCegarLoop]: 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 [2022-11-21 13:51:13,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 301 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-21 13:51:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-11-21 13:51:13,360 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) [2022-11-21 13:51:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2022-11-21 13:51:13,361 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 81 [2022-11-21 13:51:13,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:13,362 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2022-11-21 13:51:13,362 INFO L496 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) [2022-11-21 13:51:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2022-11-21 13:51:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-21 13:51:13,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:13,363 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:13,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:13,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:13,571 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:13,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1260616323, now seen corresponding path program 1 times [2022-11-21 13:51:13,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:13,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007987312] [2022-11-21 13:51:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:13,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:13,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:13,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:13,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:14,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:14,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 13:51:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 13:51:14,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:14,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007987312] [2022-11-21 13:51:14,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007987312] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:14,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479421900] [2022-11-21 13:51:14,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:14,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:14,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:14,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:51:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:14,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:51:14,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-21 13:51:14,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:51:14,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479421900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:14,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:51:14,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-21 13:51:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497937460] [2022-11-21 13:51:14,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:14,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:51:14,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:14,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:51:14,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:51:14,612 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) [2022-11-21 13:51:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:14,698 INFO L93 Difference]: Finished difference Result 825 states and 1152 transitions. [2022-11-21 13:51:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:14,699 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 [2022-11-21 13:51:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:14,704 INFO L225 Difference]: With dead ends: 825 [2022-11-21 13:51:14,704 INFO L226 Difference]: Without dead ends: 594 [2022-11-21 13:51:14,705 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:14,706 INFO L413 NwaCegarLoop]: 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 [2022-11-21 13:51:14,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 496 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-11-21 13:51:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 268. [2022-11-21 13:51:14,733 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) [2022-11-21 13:51:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 362 transitions. [2022-11-21 13:51:14,735 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 362 transitions. Word has length 83 [2022-11-21 13:51:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:14,735 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 362 transitions. [2022-11-21 13:51:14,735 INFO L496 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) [2022-11-21 13:51:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 362 transitions. [2022-11-21 13:51:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-21 13:51:14,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:14,737 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:14,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:14,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-21 13:51:14,950 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1940674693, now seen corresponding path program 1 times [2022-11-21 13:51:14,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:14,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616241457] [2022-11-21 13:51:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:15,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:15,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:15,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:15,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:15,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:15,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 13:51:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 13:51:15,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:15,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616241457] [2022-11-21 13:51:15,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616241457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:15,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038359540] [2022-11-21 13:51:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:15,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:15,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:15,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:15,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:51:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:15,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 13:51:15,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-21 13:51:15,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:51:15,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038359540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:15,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:51:15,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-21 13:51:15,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316532595] [2022-11-21 13:51:15,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:15,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:51:15,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:51:15,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:51:15,601 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) [2022-11-21 13:51:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:15,642 INFO L93 Difference]: Finished difference Result 643 states and 888 transitions. [2022-11-21 13:51:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:51:15,643 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 [2022-11-21 13:51:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:15,650 INFO L225 Difference]: With dead ends: 643 [2022-11-21 13:51:15,651 INFO L226 Difference]: Without dead ends: 406 [2022-11-21 13:51:15,651 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:15,653 INFO L413 NwaCegarLoop]: 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 [2022-11-21 13:51:15,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-11-21 13:51:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 255. [2022-11-21 13:51:15,677 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) [2022-11-21 13:51:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 345 transitions. [2022-11-21 13:51:15,679 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 345 transitions. Word has length 83 [2022-11-21 13:51:15,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:15,680 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 345 transitions. [2022-11-21 13:51:15,680 INFO L496 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) [2022-11-21 13:51:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 345 transitions. [2022-11-21 13:51:15,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-21 13:51:15,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:15,682 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:15,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:15,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:15,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash 587922057, now seen corresponding path program 1 times [2022-11-21 13:51:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:15,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980718169] [2022-11-21 13:51:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 13:51:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-21 13:51:16,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:16,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980718169] [2022-11-21 13:51:16,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980718169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:16,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:16,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:51:16,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150126427] [2022-11-21 13:51:16,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:16,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:51:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:51:16,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:51:16,297 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) [2022-11-21 13:51:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:16,604 INFO L93 Difference]: Finished difference Result 384 states and 524 transitions. [2022-11-21 13:51:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:51:16,605 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 [2022-11-21 13:51:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:16,607 INFO L225 Difference]: With dead ends: 384 [2022-11-21 13:51:16,607 INFO L226 Difference]: Without dead ends: 381 [2022-11-21 13:51:16,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:51:16,609 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 143 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:16,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 605 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:51:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-21 13:51:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 374. [2022-11-21 13:51:16,639 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) [2022-11-21 13:51:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 514 transitions. [2022-11-21 13:51:16,641 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 514 transitions. Word has length 85 [2022-11-21 13:51:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:16,642 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 514 transitions. [2022-11-21 13:51:16,642 INFO L496 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) [2022-11-21 13:51:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 514 transitions. [2022-11-21 13:51:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-21 13:51:16,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:16,644 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:16,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:51:16,644 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:16,645 INFO L85 PathProgramCache]: Analyzing trace with hash 138660115, now seen corresponding path program 1 times [2022-11-21 13:51:16,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:16,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134775040] [2022-11-21 13:51:16,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 13:51:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-21 13:51:16,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:16,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134775040] [2022-11-21 13:51:16,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134775040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:16,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:16,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:16,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331348761] [2022-11-21 13:51:16,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:16,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:16,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:16,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:16,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:16,850 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) [2022-11-21 13:51:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:17,035 INFO L93 Difference]: Finished difference Result 773 states and 1076 transitions. [2022-11-21 13:51:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:17,036 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 [2022-11-21 13:51:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:17,039 INFO L225 Difference]: With dead ends: 773 [2022-11-21 13:51:17,040 INFO L226 Difference]: Without dead ends: 525 [2022-11-21 13:51:17,040 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:17,041 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 66 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:17,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 527 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-11-21 13:51:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 374. [2022-11-21 13:51:17,073 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) [2022-11-21 13:51:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 510 transitions. [2022-11-21 13:51:17,075 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 510 transitions. Word has length 92 [2022-11-21 13:51:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:17,076 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 510 transitions. [2022-11-21 13:51:17,076 INFO L496 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) [2022-11-21 13:51:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 510 transitions. [2022-11-21 13:51:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-21 13:51:17,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:17,078 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:17,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:51:17,078 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -882408239, now seen corresponding path program 1 times [2022-11-21 13:51:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:17,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271240789] [2022-11-21 13:51:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 13:51:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-21 13:51:17,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:17,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271240789] [2022-11-21 13:51:17,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271240789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:17,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:17,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:51:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002847347] [2022-11-21 13:51:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:17,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:51:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:51:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:51:17,636 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) [2022-11-21 13:51:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:17,955 INFO L93 Difference]: Finished difference Result 940 states and 1311 transitions. [2022-11-21 13:51:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:51:17,956 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 [2022-11-21 13:51:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:17,960 INFO L225 Difference]: With dead ends: 940 [2022-11-21 13:51:17,960 INFO L226 Difference]: Without dead ends: 692 [2022-11-21 13:51:17,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:51:17,962 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 246 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:17,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 716 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:51:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-11-21 13:51:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 374. [2022-11-21 13:51:18,005 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) [2022-11-21 13:51:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 506 transitions. [2022-11-21 13:51:18,008 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 506 transitions. Word has length 92 [2022-11-21 13:51:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:18,009 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 506 transitions. [2022-11-21 13:51:18,009 INFO L496 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) [2022-11-21 13:51:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 506 transitions. [2022-11-21 13:51:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 13:51:18,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:18,011 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:18,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:51:18,012 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2027716343, now seen corresponding path program 1 times [2022-11-21 13:51:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:18,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595083795] [2022-11-21 13:51:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 13:51:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:51:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:51:18,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:18,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595083795] [2022-11-21 13:51:18,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595083795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:18,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321355553] [2022-11-21 13:51:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:18,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:18,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:18,662 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:18,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:51:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:18,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 13:51:19,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:51:19,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-21 13:51:19,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321355553] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:51:19,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:51:19,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-11-21 13:51:19,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330450572] [2022-11-21 13:51:19,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:19,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 13:51:19,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:19,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 13:51:19,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:51:19,321 INFO L87 Difference]: Start difference. First operand 374 states and 506 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 10 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 13:51:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:19,903 INFO L93 Difference]: Finished difference Result 739 states and 1006 transitions. [2022-11-21 13:51:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:51:19,904 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 10 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2022-11-21 13:51:19,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:19,907 INFO L225 Difference]: With dead ends: 739 [2022-11-21 13:51:19,907 INFO L226 Difference]: Without dead ends: 381 [2022-11-21 13:51:19,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-11-21 13:51:19,909 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 88 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:19,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 482 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:51:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-21 13:51:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-11-21 13:51:19,948 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) [2022-11-21 13:51:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 513 transitions. [2022-11-21 13:51:19,951 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 513 transitions. Word has length 99 [2022-11-21 13:51:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:19,951 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 513 transitions. [2022-11-21 13:51:19,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 10 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 13:51:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 513 transitions. [2022-11-21 13:51:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-21 13:51:19,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:19,954 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:19,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:20,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:20,168 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1894269569, now seen corresponding path program 2 times [2022-11-21 13:51:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:20,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995849790] [2022-11-21 13:51:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:20,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:20,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:20,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 13:51:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:20,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:51:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-21 13:51:20,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:20,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995849790] [2022-11-21 13:51:20,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995849790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:20,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:20,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 13:51:20,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146253853] [2022-11-21 13:51:20,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:20,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:51:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:20,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:51:20,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:51:20,743 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) [2022-11-21 13:51:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:21,141 INFO L93 Difference]: Finished difference Result 964 states and 1323 transitions. [2022-11-21 13:51:21,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:51:21,142 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 [2022-11-21 13:51:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:21,145 INFO L225 Difference]: With dead ends: 964 [2022-11-21 13:51:21,145 INFO L226 Difference]: Without dead ends: 617 [2022-11-21 13:51:21,146 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:21,147 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 90 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:21,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 765 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:51:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-21 13:51:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 393. [2022-11-21 13:51:21,190 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) [2022-11-21 13:51:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 525 transitions. [2022-11-21 13:51:21,192 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 525 transitions. Word has length 105 [2022-11-21 13:51:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:21,193 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 525 transitions. [2022-11-21 13:51:21,193 INFO L496 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) [2022-11-21 13:51:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 525 transitions. [2022-11-21 13:51:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-21 13:51:21,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:21,195 INFO L195 NwaCegarLoop]: 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] [2022-11-21 13:51:21,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:51:21,196 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:21,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1192669695, now seen corresponding path program 1 times [2022-11-21 13:51:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:21,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178204397] [2022-11-21 13:51:21,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:21,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:51:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 13:51:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:51:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:51:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 13:51:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:26,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-21 13:51:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:27,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:51:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 41 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 13:51:27,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178204397] [2022-11-21 13:51:27,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178204397] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613242845] [2022-11-21 13:51:27,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:27,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:27,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:27,780 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:27,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:51:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:28,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-21 13:51:28,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:28,363 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-21 13:51:28,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-21 13:51:28,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:51:28,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:51:29,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:51:29,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:51:29,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:51:29,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:51:29,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-21 13:51:29,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-21 13:51:30,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:30,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 13:51:30,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 13:51:30,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:51:30,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:51:31,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:51:31,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:31,238 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-21 13:51:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 25 proven. 25 refuted. 4 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 13:51:31,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:32,314 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int))) (= (mod (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#ldvarg2~0#1.base| v_ArrVal_791) |c_~#pppox_protos~0.base|) |c_~#pppox_protos~0.offset|) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#ldvarg2~0#1.base| v_ArrVal_790) |c_~#pppox_protos~0.base|) |c_~#pppox_protos~0.offset|)) 18446744073709551616) 0)) is different from false [2022-11-21 13:51:32,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613242845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:32,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:51:32,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 38 [2022-11-21 13:51:32,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310255015] [2022-11-21 13:51:32,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:32,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-21 13:51:32,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:32,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-21 13:51:32,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1772, Unknown=10, NotChecked=86, Total=2070 [2022-11-21 13:51:32,320 INFO L87 Difference]: Start difference. First operand 393 states and 525 transitions. Second operand has 38 states, 38 states have (on average 3.3684210526315788) internal successors, (128), 33 states have internal predecessors, (128), 6 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-21 13:51:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:35,051 INFO L93 Difference]: Finished difference Result 486 states and 657 transitions. [2022-11-21 13:51:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 13:51:35,052 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.3684210526315788) internal successors, (128), 33 states have internal predecessors, (128), 6 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 105 [2022-11-21 13:51:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:35,053 INFO L225 Difference]: With dead ends: 486 [2022-11-21 13:51:35,053 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 13:51:35,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=511, Invalid=3510, Unknown=15, NotChecked=124, Total=4160 [2022-11-21 13:51:35,054 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 361 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 85 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:35,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 848 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 715 Invalid, 21 Unknown, 0 Unchecked, 1.2s Time] [2022-11-21 13:51:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 13:51:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 13:51:35,056 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) [2022-11-21 13:51:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 13:51:35,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2022-11-21 13:51:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:35,056 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 13:51:35,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.3684210526315788) internal successors, (128), 33 states have internal predecessors, (128), 6 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-21 13:51:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 13:51:35,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 13:51:35,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 13:51:35,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:35,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 13:51:35,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 13:51:37,082 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5894 5904) no Hoare annotation was computed. [2022-11-21 13:51:37,083 INFO L895 garLoopResultBuilder]: At program point L5899(line 5899) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (and (= 1 (select |#valid| 5)) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|))) (not (= 5 |~#pppox_protos~0.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|))) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (not (= |~#pppox_protos~0.offset| 0)) (not (= (select |old(#valid)| 5) 1))) [2022-11-21 13:51:37,083 INFO L899 garLoopResultBuilder]: For program point L5899-1(line 5899) no Hoare annotation was computed. [2022-11-21 13:51:37,083 INFO L895 garLoopResultBuilder]: At program point L5901(line 5901) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= 1 (select |#valid| 5)) (not (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|))) (not (= 5 |~#pppox_protos~0.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|))) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (not (= |~#pppox_protos~0.offset| 0)) (not (= (select |old(#valid)| 5) 1))) [2022-11-21 13:51:37,083 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5894 5904) no Hoare annotation was computed. [2022-11-21 13:51:37,083 INFO L899 garLoopResultBuilder]: For program point L5901-1(line 5901) no Hoare annotation was computed. [2022-11-21 13:51:37,084 INFO L895 garLoopResultBuilder]: At program point ldv_init_zallocENTRY(lines 5894 5904) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|))) (not (= 5 |~#pppox_protos~0.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|))) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) (not (= |~#pppox_protos~0.offset| 0)) (not (= (select |old(#valid)| 5) 1))) [2022-11-21 13:51:37,084 INFO L899 garLoopResultBuilder]: For program point L5858-2(lines 5857 5859) no Hoare annotation was computed. [2022-11-21 13:51:37,084 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5857 5859) the Hoare annotation is: true [2022-11-21 13:51:37,084 INFO L899 garLoopResultBuilder]: For program point L5858(line 5858) no Hoare annotation was computed. [2022-11-21 13:51:37,084 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5857 5859) no Hoare annotation was computed. [2022-11-21 13:51:37,084 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6260 6266) no Hoare annotation was computed. [2022-11-21 13:51:37,084 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6260 6266) the Hoare annotation is: true [2022-11-21 13:51:37,084 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2022-11-21 13:51:37,085 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6260 6266) no Hoare annotation was computed. [2022-11-21 13:51:37,085 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5929 5935) no Hoare annotation was computed. [2022-11-21 13:51:37,085 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5929 5935) the Hoare annotation is: true [2022-11-21 13:51:37,085 INFO L899 garLoopResultBuilder]: For program point L6113-2(lines 6113 6116) no Hoare annotation was computed. [2022-11-21 13:51:37,085 INFO L899 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2022-11-21 13:51:37,085 INFO L895 garLoopResultBuilder]: At program point L6394(lines 6393 6395) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 1 (select |#valid| 5)) (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_main_~#ldvarg0~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ldvarg2~0#1.base|) |ULTIMATE.start_main_~#ldvarg2~0#1.offset|) 0) (= |~#pppox_protos~0.offset| 0) (= ~ldv_retval_0~0 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-21 13:51:37,085 INFO L895 garLoopResultBuilder]: At program point L6237(lines 6167 6242) the Hoare annotation is: (let ((.cse0 (= ~ldv_module_refcounter~0 1)) (.cse1 (= 1 (select |#valid| 5))) (.cse2 (= |ULTIMATE.start_main_~#ldvarg0~0#1.offset| 0)) (.cse3 (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|))) (.cse4 (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|))) (.cse5 (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0)) (.cse6 (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|))) (.cse7 (= 5 |~#pppox_protos~0.base|)) (.cse8 (= (select (select |#memory_int| |ULTIMATE.start_main_~#ldvarg2~0#1.base|) |ULTIMATE.start_main_~#ldvarg2~0#1.offset|) 0)) (.cse9 (= |~#pppox_protos~0.offset| 0)) (.cse10 (= ~ldv_retval_0~0 0)) (.cse11 (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|)))) (or (and .cse0 .cse1 (= ~ldv_state_variable_0~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~ldv_state_variable_1~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~ldv_state_variable_0~0 3)))) [2022-11-21 13:51:37,086 INFO L899 garLoopResultBuilder]: For program point L6204(lines 6204 6209) no Hoare annotation was computed. [2022-11-21 13:51:37,086 INFO L895 garLoopResultBuilder]: At program point L6328(lines 6314 6330) the Hoare annotation is: false [2022-11-21 13:51:37,086 INFO L899 garLoopResultBuilder]: For program point L6320(lines 6320 6325) no Hoare annotation was computed. [2022-11-21 13:51:37,086 INFO L895 garLoopResultBuilder]: At program point L6221(lines 6167 6242) the Hoare annotation is: (= ~ldv_module_refcounter~0 1) [2022-11-21 13:51:37,086 INFO L899 garLoopResultBuilder]: For program point L6180(lines 6180 6236) no Hoare annotation was computed. [2022-11-21 13:51:37,086 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 13:51:37,087 INFO L899 garLoopResultBuilder]: For program point L6362(lines 6362 6365) no Hoare annotation was computed. [2022-11-21 13:51:37,087 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 13:51:37,088 INFO L902 garLoopResultBuilder]: At program point L6362-1(lines 6359 6368) the Hoare annotation is: true [2022-11-21 13:51:37,088 INFO L895 garLoopResultBuilder]: At program point L6255(line 6255) the Hoare annotation is: false [2022-11-21 13:51:37,088 INFO L895 garLoopResultBuilder]: At program point L6255-1(lines 6252 6258) the Hoare annotation is: false [2022-11-21 13:51:37,088 INFO L899 garLoopResultBuilder]: For program point L6214(lines 6214 6218) no Hoare annotation was computed. [2022-11-21 13:51:37,088 INFO L899 garLoopResultBuilder]: For program point L6181(line 6181) no Hoare annotation was computed. [2022-11-21 13:51:37,089 INFO L899 garLoopResultBuilder]: For program point L6214-2(lines 6212 6224) no Hoare annotation was computed. [2022-11-21 13:51:37,089 INFO L895 garLoopResultBuilder]: At program point L6363(line 6363) the Hoare annotation is: false [2022-11-21 13:51:37,089 INFO L895 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_~#ldvarg0~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= |~#pppox_protos~0.offset| 0) (= ~ldv_retval_0~0 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-21 13:51:37,089 INFO L899 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2022-11-21 13:51:37,090 INFO L899 garLoopResultBuilder]: For program point L6182(lines 6182 6197) no Hoare annotation was computed. [2022-11-21 13:51:37,090 INFO L895 garLoopResultBuilder]: At program point L6174(line 6174) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_~#ldvarg0~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= |~#pppox_protos~0.offset| 0) (= ~ldv_retval_0~0 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-21 13:51:37,091 INFO L895 garLoopResultBuilder]: At program point L5918(lines 5913 5920) the Hoare annotation is: false [2022-11-21 13:51:37,091 INFO L899 garLoopResultBuilder]: For program point L6174-1(line 6174) no Hoare annotation was computed. [2022-11-21 13:51:37,091 INFO L899 garLoopResultBuilder]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2022-11-21 13:51:37,091 INFO L895 garLoopResultBuilder]: At program point L6397(lines 6396 6398) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2022-11-21 13:51:37,092 INFO L899 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2022-11-21 13:51:37,094 INFO L895 garLoopResultBuilder]: At program point L6133(lines 6106 6135) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_~#ldvarg0~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (= |ULTIMATE.start_pppox_create_~protocol#1| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= 5 |~#pppox_protos~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ldvarg2~0#1.base|) |ULTIMATE.start_main_~#ldvarg2~0#1.offset|) 0) (let ((.cse0 (= 0 |ULTIMATE.start_main_~tmp___1~0#1|))) (or (and (not |ULTIMATE.start_main_#t~switch71#1|) (not .cse0)) (and .cse0 |ULTIMATE.start_main_#t~switch71#1|))) (= |~#pppox_protos~0.offset| 0) (= ~ldv_retval_0~0 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|)) (= ~ldv_state_variable_0~0 3)) [2022-11-21 13:51:37,094 INFO L895 garLoopResultBuilder]: At program point L6150(lines 6146 6152) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2022-11-21 13:51:37,094 INFO L895 garLoopResultBuilder]: At program point L6249(lines 6244 6251) the Hoare annotation is: false [2022-11-21 13:51:37,094 INFO L899 garLoopResultBuilder]: For program point L6117(lines 6117 6130) no Hoare annotation was computed. [2022-11-21 13:51:37,095 INFO L902 garLoopResultBuilder]: At program point L6241(lines 6156 6243) the Hoare annotation is: true [2022-11-21 13:51:37,095 INFO L895 garLoopResultBuilder]: At program point L6134(lines 6101 6136) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_~#ldvarg0~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (= |ULTIMATE.start_pppox_create_~protocol#1| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= 5 |~#pppox_protos~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ldvarg2~0#1.base|) |ULTIMATE.start_main_~#ldvarg2~0#1.offset|) 0) (let ((.cse0 (= 0 |ULTIMATE.start_main_~tmp___1~0#1|))) (or (and (not |ULTIMATE.start_main_#t~switch71#1|) (not .cse0)) (and .cse0 |ULTIMATE.start_main_#t~switch71#1|))) (= |~#pppox_protos~0.offset| 0) (= ~ldv_retval_0~0 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|)) (= ~ldv_state_variable_0~0 3)) [2022-11-21 13:51:37,095 INFO L899 garLoopResultBuilder]: For program point L6200(lines 6200 6232) no Hoare annotation was computed. [2022-11-21 13:51:37,095 INFO L899 garLoopResultBuilder]: For program point L6192(line 6192) no Hoare annotation was computed. [2022-11-21 13:51:37,095 INFO L899 garLoopResultBuilder]: For program point L6184(lines 6184 6194) no Hoare annotation was computed. [2022-11-21 13:51:37,096 INFO L895 garLoopResultBuilder]: At program point L6143(lines 6138 6145) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 1 (select |#valid| 5)) (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_main_~#ldvarg0~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ldvarg2~0#1.base|) |ULTIMATE.start_main_~#ldvarg2~0#1.offset|) 0) (= |~#pppox_protos~0.offset| 0) (= ~ldv_retval_0~0 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-21 13:51:37,096 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 13:51:37,096 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-11-21 13:51:37,096 INFO L899 garLoopResultBuilder]: For program point L6234(line 6234) no Hoare annotation was computed. [2022-11-21 13:51:37,096 INFO L899 garLoopResultBuilder]: For program point L6168-1(line 6168) no Hoare annotation was computed. [2022-11-21 13:51:37,096 INFO L895 garLoopResultBuilder]: At program point L6168(line 6168) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_~#ldvarg0~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= |~#pppox_protos~0.offset| 0) (= ~ldv_retval_0~0 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-21 13:51:37,096 INFO L902 garLoopResultBuilder]: At program point L6193(line 6193) the Hoare annotation is: true [2022-11-21 13:51:37,096 INFO L899 garLoopResultBuilder]: For program point L6185(line 6185) no Hoare annotation was computed. [2022-11-21 13:51:37,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 13:51:37,097 INFO L902 garLoopResultBuilder]: At program point L6235(line 6235) the Hoare annotation is: true [2022-11-21 13:51:37,097 INFO L899 garLoopResultBuilder]: For program point L6202(lines 6202 6229) no Hoare annotation was computed. [2022-11-21 13:51:37,097 INFO L899 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2022-11-21 13:51:37,098 INFO L899 garLoopResultBuilder]: For program point L6318(lines 6318 6327) no Hoare annotation was computed. [2022-11-21 13:51:37,098 INFO L899 garLoopResultBuilder]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2022-11-21 13:51:37,098 INFO L899 garLoopResultBuilder]: For program point L6211(line 6211) no Hoare annotation was computed. [2022-11-21 13:51:37,098 INFO L899 garLoopResultBuilder]: For program point L6203(line 6203) no Hoare annotation was computed. [2022-11-21 13:51:37,098 INFO L895 garLoopResultBuilder]: At program point L6170(line 6170) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_~#ldvarg0~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= |~#pppox_protos~0.offset| 0) (= ~ldv_retval_0~0 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-21 13:51:37,098 INFO L899 garLoopResultBuilder]: For program point L6170-1(line 6170) no Hoare annotation was computed. [2022-11-21 13:51:37,098 INFO L902 garLoopResultBuilder]: At program point L6228(line 6228) the Hoare annotation is: true [2022-11-21 13:51:37,099 INFO L899 garLoopResultBuilder]: For program point L6121-2(lines 6119 6130) no Hoare annotation was computed. [2022-11-21 13:51:37,099 INFO L899 garLoopResultBuilder]: For program point L6121(lines 6121 6125) no Hoare annotation was computed. [2022-11-21 13:51:37,099 INFO L895 garLoopResultBuilder]: At program point L6377(lines 6376 6378) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_~#ldvarg0~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= |~#pppox_protos~0.offset| 0) (= ~ldv_retval_0~0 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-21 13:51:37,099 INFO L899 garLoopResultBuilder]: For program point L6212(lines 6212 6225) no Hoare annotation was computed. [2022-11-21 13:51:37,099 INFO L899 garLoopResultBuilder]: For program point L6334(lines 6334 6341) no Hoare annotation was computed. [2022-11-21 13:51:37,100 INFO L899 garLoopResultBuilder]: For program point L6335-1(lines 6335 6338) no Hoare annotation was computed. [2022-11-21 13:51:37,100 INFO L899 garLoopResultBuilder]: For program point L6335(lines 6335 6338) no Hoare annotation was computed. [2022-11-21 13:51:37,100 INFO L902 garLoopResultBuilder]: At program point L6336(line 6336) the Hoare annotation is: true [2022-11-21 13:51:37,100 INFO L899 garLoopResultBuilder]: For program point L6334-2(lines 6331 6344) no Hoare annotation was computed. [2022-11-21 13:51:37,100 INFO L902 garLoopResultBuilder]: At program point ldv_module_putENTRY(lines 6331 6344) the Hoare annotation is: true [2022-11-21 13:51:37,100 INFO L899 garLoopResultBuilder]: For program point ldv_module_putEXIT(lines 6331 6344) no Hoare annotation was computed. [2022-11-21 13:51:37,100 INFO L899 garLoopResultBuilder]: For program point ldv_memsetFINAL(lines 5905 5912) no Hoare annotation was computed. [2022-11-21 13:51:37,109 INFO L895 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: (let ((.cse0 (= |ldv_memset_#Ultimate.C_memset_#ptr#1.base| |ldv_memset_#in~s#1.base|)) (.cse1 (= |ldv_memset_#in~s#1.offset| |ldv_memset_#Ultimate.C_memset_#ptr#1.offset|)) (.cse4 (select |#memory_int| |ldv_memset_#Ultimate.C_memset_#ptr#1.base|)) (.cse2 (= |ldv_memset_#in~n#1| |ldv_memset_#Ultimate.C_memset_#amount#1|))) (or (and (= |ldv_memset_#Ultimate.C_memset_#t~loopctr92#1| 0) (= |#memory_int| |old(#memory_int)|) .cse0 .cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |ldv_memset_#Ultimate.C_memset_#value#1| |ldv_memset_#in~c#1|) .cse2) (not (= ~ldv_state_variable_1~0 0)) (not (= 5 |~#pppox_protos~0.base|)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (not (= 1 (select |#valid| 5))) (not (= |~#pppox_protos~0.offset| 0)) (let ((.cse3 (= |ldv_memset_#Ultimate.C_memset_#ptr#1.offset| 0))) (and .cse0 (exists ((v_ArrVal_744 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |ldv_memset_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_744))) (or (not .cse3) (and (= |ldv_memset_#in~c#1| (select .cse4 0)) (<= 2 (+ |ldv_memset_#Ultimate.C_memset_#t~loopctr92#1| |ldv_memset_#Ultimate.C_memset_#ptr#1.offset|)))) (or .cse1 .cse3) (exists ((v_ArrVal_743 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |ldv_memset_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_743))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|) 0)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|) 0)) (and .cse0 .cse1 (exists ((v_ArrVal_753 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |ldv_memset_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_753))) (= (select .cse4 (+ (- 1) |ldv_memset_#Ultimate.C_memset_#t~loopctr92#1| |ldv_memset_#Ultimate.C_memset_#ptr#1.offset|)) |ldv_memset_#in~c#1|) (= |ldv_memset_#Ultimate.C_memset_#t~loopctr92#1| 1) (< (mod (+ 18446744073709551615 |ldv_memset_#Ultimate.C_memset_#t~loopctr92#1|) 18446744073709551616) (mod |ldv_memset_#Ultimate.C_memset_#amount#1| 18446744073709551616)) (exists ((v_ArrVal_751 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |ldv_memset_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_751))) .cse2))) [2022-11-21 13:51:37,109 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-21 13:51:37,109 INFO L895 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 (= 5 |~#pppox_protos~0.base|)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (not (= 1 (select |#valid| 5))) (not (= |~#pppox_protos~0.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|) 0)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|) 0))) [2022-11-21 13:51:37,111 INFO L899 garLoopResultBuilder]: For program point ldv_memsetEXIT(lines 5905 5912) no Hoare annotation was computed. [2022-11-21 13:51:37,113 INFO L895 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|))) (not (= 5 |~#pppox_protos~0.base|)) (= |#memory_int| |old(#memory_int)|) (not (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|))) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (not (= 1 (select |#valid| 5))) (not (= |~#pppox_protos~0.offset| 0))) [2022-11-21 13:51:37,113 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-11-21 13:51:37,113 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-11-21 13:51:37,117 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:37,122 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 13:51:37,152 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,153 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,156 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,157 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,158 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,158 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_744,QUANTIFIED] [2022-11-21 13:51:37,159 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,159 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,159 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,159 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,160 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,160 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,161 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_743,QUANTIFIED] [2022-11-21 13:51:37,161 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,161 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,162 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,162 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_753,QUANTIFIED] [2022-11-21 13:51:37,163 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,163 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,163 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,163 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,163 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,164 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_751,QUANTIFIED] [2022-11-21 13:51:37,164 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,165 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,166 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,167 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,168 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_744,QUANTIFIED] [2022-11-21 13:51:37,168 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,168 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,168 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,168 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,169 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,169 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,169 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_743,QUANTIFIED] [2022-11-21 13:51:37,170 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,170 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,170 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,171 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_753,QUANTIFIED] [2022-11-21 13:51:37,171 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,172 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,172 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,172 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_751,QUANTIFIED] [2022-11-21 13:51:37,173 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,174 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,176 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,179 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,179 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,189 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:51:37 BoogieIcfgContainer [2022-11-21 13:51:37,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 13:51:37,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 13:51:37,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 13:51:37,203 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 13:51:37,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:51:08" (3/4) ... [2022-11-21 13:51:37,207 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 13:51:37,216 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-21 13:51:37,216 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-21 13:51:37,216 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2022-11-21 13:51:37,217 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2022-11-21 13:51:37,217 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-21 13:51:37,217 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2022-11-21 13:51:37,217 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-11-21 13:51:37,232 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2022-11-21 13:51:37,234 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-21 13:51:37,234 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-21 13:51:37,235 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 13:51:37,266 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((aux-#t~loopctr92-aux == 0 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #Ultimate.C_memset_#ptr#1 == s) && s == #Ultimate.C_memset_#ptr#1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && unknown-#value-unknown == \old(c)) && \old(n) == unknown-#amount-unknown) || !(ldv_state_variable_1 == 0)) || !(5 == pppox_protos)) || !(ldv_module_refcounter == 1)) || !(ldv_retval_0 == 0)) || !(1 == \valid[5])) || !(pppox_protos == 0)) || ((((#Ultimate.C_memset_#ptr#1 == s && (\exists v_ArrVal_744 : [int]int :: #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := v_ArrVal_744])) && (!(#Ultimate.C_memset_#ptr#1 == 0) || (\old(c) == unknown-#memory_int-unknown[#Ultimate.C_memset_#ptr#1][0] && 2 <= aux-#t~loopctr92-aux + #Ultimate.C_memset_#ptr#1))) && (s == #Ultimate.C_memset_#ptr#1 || #Ultimate.C_memset_#ptr#1 == 0)) && (\exists v_ArrVal_743 : [int]int :: #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := v_ArrVal_743]))) || !(\old(#memory_$Pointer$)[pppox_protos][pppox_protos] == 0)) || !(\old(#memory_$Pointer$)[pppox_protos][pppox_protos] == 0)) || (((((((#Ultimate.C_memset_#ptr#1 == s && s == #Ultimate.C_memset_#ptr#1) && (\exists v_ArrVal_753 : [int]int :: #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := v_ArrVal_753])) && unknown-#memory_int-unknown[#Ultimate.C_memset_#ptr#1][-1 + aux-#t~loopctr92-aux + #Ultimate.C_memset_#ptr#1] == \old(c)) && aux-#t~loopctr92-aux == 1) && (18446744073709551615 + aux-#t~loopctr92-aux) % 18446744073709551616 < unknown-#amount-unknown % 18446744073709551616) && (\exists v_ArrVal_751 : [int]int :: #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := v_ArrVal_751])) && \old(n) == unknown-#amount-unknown) [2022-11-21 13:51:37,327 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 13:51:37,327 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 13:51:37,328 INFO L158 Benchmark]: Toolchain (without parser) took 31591.70ms. Allocated memory was 165.7MB in the beginning and 450.9MB in the end (delta: 285.2MB). Free memory was 124.1MB in the beginning and 148.6MB in the end (delta: -24.5MB). Peak memory consumption was 263.0MB. Max. memory is 16.1GB. [2022-11-21 13:51:37,328 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 133.6MB in the end (delta: 86.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:51:37,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1518.55ms. Allocated memory was 165.7MB in the beginning and 216.0MB in the end (delta: 50.3MB). Free memory was 124.1MB in the beginning and 144.5MB in the end (delta: -20.4MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2022-11-21 13:51:37,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.32ms. Allocated memory is still 216.0MB. Free memory was 144.5MB in the beginning and 141.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 13:51:37,329 INFO L158 Benchmark]: Boogie Preprocessor took 109.04ms. Allocated memory is still 216.0MB. Free memory was 141.3MB in the beginning and 137.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 13:51:37,329 INFO L158 Benchmark]: RCFGBuilder took 983.89ms. Allocated memory is still 216.0MB. Free memory was 137.1MB in the beginning and 106.7MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-21 13:51:37,330 INFO L158 Benchmark]: TraceAbstraction took 28724.43ms. Allocated memory was 216.0MB in the beginning and 450.9MB in the end (delta: 234.9MB). Free memory was 106.7MB in the beginning and 157.1MB in the end (delta: -50.4MB). Peak memory consumption was 185.5MB. Max. memory is 16.1GB. [2022-11-21 13:51:37,330 INFO L158 Benchmark]: Witness Printer took 129.15ms. Allocated memory is still 450.9MB. Free memory was 156.1MB in the beginning and 148.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-21 13:51:37,332 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.35ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 133.6MB in the end (delta: 86.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1518.55ms. Allocated memory was 165.7MB in the beginning and 216.0MB in the end (delta: 50.3MB). Free memory was 124.1MB in the beginning and 144.5MB in the end (delta: -20.4MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.32ms. Allocated memory is still 216.0MB. Free memory was 144.5MB in the beginning and 141.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.04ms. Allocated memory is still 216.0MB. Free memory was 141.3MB in the beginning and 137.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 983.89ms. Allocated memory is still 216.0MB. Free memory was 137.1MB in the beginning and 106.7MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28724.43ms. Allocated memory was 216.0MB in the beginning and 450.9MB in the end (delta: 234.9MB). Free memory was 106.7MB in the beginning and 157.1MB in the end (delta: -50.4MB). Peak memory consumption was 185.5MB. Max. memory is 16.1GB. * Witness Printer took 129.15ms. Allocated memory is still 450.9MB. Free memory was 156.1MB in the beginning and 148.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. 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: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_744,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_743,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_753,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_751,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_744,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_743,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_753,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_751,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - 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$.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$.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$.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$.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$.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 * 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: 28.5s, OverallIterations: 14, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 1765 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1752 mSDsluCounter, 6385 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4910 mSDsCounter, 322 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1889 IncrementalHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 322 mSolverCounterUnsat, 1475 mSDtfsCounter, 1889 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 967 GetRequests, 790 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=13, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1216 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 161 PreInvPairs, 197 NumberOfFragments, 1065 HoareAnnotationTreeSize, 161 FomulaSimplifications, 960 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 35 FomulaSimplificationsInter, 4625 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 1596 NumberOfCodeBlocks, 1596 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1675 ConstructedInterpolants, 14 QuantifiedInterpolants, 6041 SizeOfPredicates, 35 NumberOfNonLiveVariables, 4211 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 554/648 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 Derived loop invariant: 0 - 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 [2022-11-21 13:51:37,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((ldv_module_refcounter == 1 && 1 == \valid[5]) && ldv_state_variable_0 == 1) && ldvarg0 == 0) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && !(5 == ldvarg0)) && ldv_state_variable_1 == 0) && 5 == pppox_protos) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && pppox_protos == 0) && ldv_retval_0 == 0) && !(5 == ldvarg2) - InvariantResult [Line: 6314]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6252]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6156]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant [2022-11-21 13:51:37,365 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,368 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,371 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_744,QUANTIFIED] [2022-11-21 13:51:37,372 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,372 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,373 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,373 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,373 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,373 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_743,QUANTIFIED] [2022-11-21 13:51:37,375 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,375 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,376 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_753,QUANTIFIED] [2022-11-21 13:51:37,376 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,377 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,377 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,377 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,377 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_751,QUANTIFIED] [2022-11-21 13:51:37,377 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,379 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,379 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,380 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,381 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_744,QUANTIFIED] [2022-11-21 13:51:37,381 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,381 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,381 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,381 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,382 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,382 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,382 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_743,QUANTIFIED] [2022-11-21 13:51:37,382 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,383 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,383 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,384 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,385 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_753,QUANTIFIED] [2022-11-21 13:51:37,385 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,385 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,385 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-21 13:51:37,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_751,QUANTIFIED] [2022-11-21 13:51:37,387 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled Derived loop invariant: ((((((((((((((((aux-#t~loopctr92-aux == 0 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #Ultimate.C_memset_#ptr#1 == s) && s == #Ultimate.C_memset_#ptr#1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && unknown-#value-unknown == \old(c)) && \old(n) == unknown-#amount-unknown) || !(ldv_state_variable_1 == 0)) || !(5 == pppox_protos)) || !(ldv_module_refcounter == 1)) || !(ldv_retval_0 == 0)) || !(1 == \valid[5])) || !(pppox_protos == 0)) || ((((#Ultimate.C_memset_#ptr#1 == s && (\exists v_ArrVal_744 : [int]int :: #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := v_ArrVal_744])) && (!(#Ultimate.C_memset_#ptr#1 == 0) || (\old(c) == unknown-#memory_int-unknown[#Ultimate.C_memset_#ptr#1][0] && 2 <= aux-#t~loopctr92-aux + #Ultimate.C_memset_#ptr#1))) && (s == #Ultimate.C_memset_#ptr#1 || #Ultimate.C_memset_#ptr#1 == 0)) && (\exists v_ArrVal_743 : [int]int :: #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := v_ArrVal_743]))) || !(\old(#memory_$Pointer$)[pppox_protos][pppox_protos] == 0)) || !(\old(#memory_$Pointer$)[pppox_protos][pppox_protos] == 0)) || (((((((#Ultimate.C_memset_#ptr#1 == s && s == #Ultimate.C_memset_#ptr#1) && (\exists v_ArrVal_753 : [int]int :: #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := v_ArrVal_753])) && unknown-#memory_int-unknown[#Ultimate.C_memset_#ptr#1][-1 + aux-#t~loopctr92-aux + #Ultimate.C_memset_#ptr#1] == \old(c)) && aux-#t~loopctr92-aux == 1) && (18446744073709551615 + aux-#t~loopctr92-aux) % 18446744073709551616 < unknown-#amount-unknown % 18446744073709551616) && (\exists v_ArrVal_751 : [int]int :: #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := v_ArrVal_751])) && \old(n) == unknown-#amount-unknown) - InvariantResult [Line: 6376]: Loop Invariant [2022-11-21 13:51:37,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((ldv_module_refcounter == 1 && 1 == \valid[5]) && ldvarg0 == 0) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && !(5 == ldvarg0)) && ldv_state_variable_1 == 0) && 5 == pppox_protos) && pppox_protos == 0) && ldv_retval_0 == 0) && !(5 == ldvarg2) - 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 [2022-11-21 13:51:37,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,396 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,396 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((ldv_module_refcounter == 1 && 1 == \valid[5]) && ldv_state_variable_0 == 1) && ldvarg0 == 0) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && !(5 == ldvarg0)) && ldv_state_variable_1 == 0) && 5 == pppox_protos) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && pppox_protos == 0) && ldv_retval_0 == 0) && !(5 == ldvarg2)) || ((((((((((((ldv_module_refcounter == 1 && 1 == \valid[5]) && ldvarg0 == 0) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && !(5 == ldvarg0)) && 5 == pppox_protos) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && pppox_protos == 0) && ldv_retval_0 == 0) && !(5 == ldvarg2)) && ldv_state_variable_0 == 3) - InvariantResult [Line: 6101]: Loop Invariant [2022-11-21 13:51:37,399 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,400 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((ldv_module_refcounter == 1 && 1 == \valid[5]) && ldvarg0 == 0) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && protocol == 0) && !(5 == ldvarg0)) && 5 == pppox_protos) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && ((!aux-switch (tmp___1) { case 0: ; if (ldv_state_variable_1 != 0) { tmp___2 = __VERIFIER_nondet_int(); switch (tmp___2) { case 0: ; if (ldv_state_variable_1 == 1) { pppox_create(ldvarg1, ldvarg3, ldvarg2, ldvarg0); ldv_state_variable_1 = 1; } else { } goto ldv_47574; default: ldv_stop(); } ldv_47574: ; } else { } goto ldv_47576; case 1: ; if (ldv_state_variable_0 != 0) { tmp___3 = __VERIFIER_nondet_int(); switch (tmp___3) { case 0: ; if (ldv_state_variable_0 == 3 && ref_cnt == 0) { pppox_exit(); ldv_state_variable_0 = 2; goto ldv_final; } else { } goto ldv_47580; case 1: ; if (ldv_state_variable_0 == 1) { ldv_retval_0 = pppox_init(); if (ldv_retval_0 == 0) { ldv_state_variable_0 = 3; ldv_state_variable_1 = 1; } else { } if (ldv_retval_0 != 0) { ldv_state_variable_0 = 2; goto ldv_final; } else { } } else { } goto ldv_47580; default: ldv_stop(); } ldv_47580: ; } else { } goto ldv_47576; default: ldv_stop(); }-aux && !(0 == tmp___1)) || (0 == tmp___1 && aux-switch (tmp___1) { case 0: ; if (ldv_state_variable_1 != 0) { tmp___2 = __VERIFIER_nondet_int(); switch (tmp___2) { case 0: ; if (ldv_state_variable_1 == 1) { pppox_create(ldvarg1, ldvarg3, ldvarg2, ldvarg0); ldv_state_variable_1 = 1; } else { } goto ldv_47574; default: ldv_stop(); } ldv_47574: ; } else { } goto ldv_47576; case 1: ; if (ldv_state_variable_0 != 0) { tmp___3 = __VERIFIER_nondet_int(); switch (tmp___3) { case 0: ; if (ldv_state_variable_0 == 3 && ref_cnt == 0) { pppox_exit(); ldv_state_variable_0 = 2; goto ldv_final; } else { } goto ldv_47580; case 1: ; if (ldv_state_variable_0 == 1) { ldv_retval_0 = pppox_init(); if (ldv_retval_0 == 0) { ldv_state_variable_0 = 3; ldv_state_variable_1 = 1; } else { } if (ldv_retval_0 != 0) { ldv_state_variable_0 = 2; goto ldv_final; } else { } } else { } goto ldv_47580; default: ldv_stop(); } ldv_47580: ; } else { } goto ldv_47576; default: ldv_stop(); }-aux))) && pppox_protos == 0) && ldv_retval_0 == 0) && !(5 == ldvarg2)) && ldv_state_variable_0 == 3 - InvariantResult [Line: 5913]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5929]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6393]: Loop Invariant [2022-11-21 13:51:37,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((ldv_module_refcounter == 1 && 1 == \valid[5]) && ldv_state_variable_0 == 1) && ldvarg0 == 0) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && !(5 == ldvarg0)) && ldv_state_variable_1 == 0) && 5 == pppox_protos) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && pppox_protos == 0) && ldv_retval_0 == 0) && !(5 == ldvarg2) - InvariantResult [Line: 6106]: Loop Invariant [2022-11-21 13:51:37,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 13:51:37,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 13:51:37,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((ldv_module_refcounter == 1 && 1 == \valid[5]) && ldvarg0 == 0) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && protocol == 0) && !(5 == ldvarg0)) && 5 == pppox_protos) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && ((!aux-switch (tmp___1) { case 0: ; if (ldv_state_variable_1 != 0) { tmp___2 = __VERIFIER_nondet_int(); switch (tmp___2) { case 0: ; if (ldv_state_variable_1 == 1) { pppox_create(ldvarg1, ldvarg3, ldvarg2, ldvarg0); ldv_state_variable_1 = 1; } else { } goto ldv_47574; default: ldv_stop(); } ldv_47574: ; } else { } goto ldv_47576; case 1: ; if (ldv_state_variable_0 != 0) { tmp___3 = __VERIFIER_nondet_int(); switch (tmp___3) { case 0: ; if (ldv_state_variable_0 == 3 && ref_cnt == 0) { pppox_exit(); ldv_state_variable_0 = 2; goto ldv_final; } else { } goto ldv_47580; case 1: ; if (ldv_state_variable_0 == 1) { ldv_retval_0 = pppox_init(); if (ldv_retval_0 == 0) { ldv_state_variable_0 = 3; ldv_state_variable_1 = 1; } else { } if (ldv_retval_0 != 0) { ldv_state_variable_0 = 2; goto ldv_final; } else { } } else { } goto ldv_47580; default: ldv_stop(); } ldv_47580: ; } else { } goto ldv_47576; default: ldv_stop(); }-aux && !(0 == tmp___1)) || (0 == tmp___1 && aux-switch (tmp___1) { case 0: ; if (ldv_state_variable_1 != 0) { tmp___2 = __VERIFIER_nondet_int(); switch (tmp___2) { case 0: ; if (ldv_state_variable_1 == 1) { pppox_create(ldvarg1, ldvarg3, ldvarg2, ldvarg0); ldv_state_variable_1 = 1; } else { } goto ldv_47574; default: ldv_stop(); } ldv_47574: ; } else { } goto ldv_47576; case 1: ; if (ldv_state_variable_0 != 0) { tmp___3 = __VERIFIER_nondet_int(); switch (tmp___3) { case 0: ; if (ldv_state_variable_0 == 3 && ref_cnt == 0) { pppox_exit(); ldv_state_variable_0 = 2; goto ldv_final; } else { } goto ldv_47580; case 1: ; if (ldv_state_variable_0 == 1) { ldv_retval_0 = pppox_init(); if (ldv_retval_0 == 0) { ldv_state_variable_0 = 3; ldv_state_variable_1 = 1; } else { } if (ldv_retval_0 != 0) { ldv_state_variable_0 = 2; goto ldv_final; } else { } } else { } goto ldv_47580; default: ldv_stop(); } ldv_47580: ; } else { } goto ldv_47576; default: ldv_stop(); }-aux))) && pppox_protos == 0) && ldv_retval_0 == 0) && !(5 == ldvarg2)) && ldv_state_variable_0 == 3 RESULT: Ultimate proved your program to be correct! [2022-11-21 13:51:37,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e6555fa-312f-4705-92be-96d6c1ccdcc8/bin/uautomizer-vX5HgA9Q3a/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