./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc --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 32bit --witnessprinter.graph.data.programhash 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 --- 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-5e519f3 [2022-11-02 20:34:34,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:34:34,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:34:34,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:34:34,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:34:34,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:34:34,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:34:34,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:34:34,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:34:34,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:34:34,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:34:34,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:34:34,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:34:34,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:34:34,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:34:34,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:34:34,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:34:34,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:34:34,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:34:34,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:34:34,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:34:34,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:34:34,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:34:34,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:34:34,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:34:34,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:34:34,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:34:34,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:34:34,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:34:34,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:34:34,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:34:34,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:34:34,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:34:34,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:34:34,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:34:34,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:34:34,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:34:34,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:34:34,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:34:34,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:34:34,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:34:34,586 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:34:34,625 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:34:34,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:34:34,629 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:34:34,629 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:34:34,630 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:34:34,630 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:34:34,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:34:34,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:34:34,632 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:34:34,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:34:34,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:34:34,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:34:34,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:34:34,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:34:34,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:34:34,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:34:34,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:34:34,635 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:34:34,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:34:34,635 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:34:34,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:34:34,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:34:34,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:34:34,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:34:34,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:34:34,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:34:34,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:34:34,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:34:34,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:34:34,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:34:34,639 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:34:34,639 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:34:34,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:34:34,640 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_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/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_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 [2022-11-02 20:34:34,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:34:34,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:34:34,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:34:34,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:34:34,969 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:34:34,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2022-11-02 20:34:35,057 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/data/031af20e0/f96775af28e846f0b4548930717b3732/FLAGe8f84a884 [2022-11-02 20:34:35,630 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:34:35,632 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2022-11-02 20:34:35,638 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/data/031af20e0/f96775af28e846f0b4548930717b3732/FLAGe8f84a884 [2022-11-02 20:34:35,966 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/data/031af20e0/f96775af28e846f0b4548930717b3732 [2022-11-02 20:34:35,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:34:35,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:34:35,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:34:35,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:34:35,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:34:35,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:34:35" (1/1) ... [2022-11-02 20:34:35,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0546b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:35, skipping insertion in model container [2022-11-02 20:34:35,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:34:35" (1/1) ... [2022-11-02 20:34:35,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:34:36,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:34:36,207 WARN L230 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_c48292ff-d02e-44c9-80bd-63d6b041398c/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c[619,632] [2022-11-02 20:34:36,226 WARN L1543 CHandler]: Possible shadowing of function min [2022-11-02 20:34:36,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:34:36,252 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:34:36,266 WARN L230 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_c48292ff-d02e-44c9-80bd-63d6b041398c/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c[619,632] [2022-11-02 20:34:36,280 WARN L1543 CHandler]: Possible shadowing of function min [2022-11-02 20:34:36,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:34:36,320 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:34:36,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36 WrapperNode [2022-11-02 20:34:36,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:34:36,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:34:36,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:34:36,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:34:36,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,392 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2022-11-02 20:34:36,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:34:36,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:34:36,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:34:36,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:34:36,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,425 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:34:36,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:34:36,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:34:36,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:34:36,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:34:36,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:36,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:34:36,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:34:36,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:34:36,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:34:36,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:34:36,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:34:36,543 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-11-02 20:34:36,544 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-11-02 20:34:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:34:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:34:36,544 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:34:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:34:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-11-02 20:34:36,545 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-11-02 20:34:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:34:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:34:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-11-02 20:34:36,546 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-11-02 20:34:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:34:36,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:34:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:34:36,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:34:36,547 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-11-02 20:34:36,547 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-11-02 20:34:36,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:34:36,663 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:34:36,665 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:34:37,047 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:34:37,054 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:34:37,055 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:34:37,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:34:37 BoogieIcfgContainer [2022-11-02 20:34:37,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:34:37,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:34:37,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:34:37,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:34:37,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:34:35" (1/3) ... [2022-11-02 20:34:37,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4e140e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:34:37, skipping insertion in model container [2022-11-02 20:34:37,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (2/3) ... [2022-11-02 20:34:37,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4e140e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:34:37, skipping insertion in model container [2022-11-02 20:34:37,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:34:37" (3/3) ... [2022-11-02 20:34:37,067 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2022-11-02 20:34:37,089 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:34:37,089 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:34:37,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:34:37,181 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;@1752fd78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:34:37,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:34:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-02 20:34:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:34:37,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:37,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:34:37,224 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:37,229 INFO L85 PathProgramCache]: Analyzing trace with hash -858928279, now seen corresponding path program 1 times [2022-11-02 20:34:37,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:37,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551918789] [2022-11-02 20:34:37,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:34:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:37,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:34:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:34:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:37,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:34:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:37,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:37,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551918789] [2022-11-02 20:34:37,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551918789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:37,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:37,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:34:37,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262783003] [2022-11-02 20:34:37,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:37,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:34:37,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:34:37,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:34:37,723 INFO L87 Difference]: Start difference. First operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:34:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:37,979 INFO L93 Difference]: Finished difference Result 142 states and 192 transitions. [2022-11-02 20:34:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:37,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-11-02 20:34:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:37,992 INFO L225 Difference]: With dead ends: 142 [2022-11-02 20:34:37,992 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:34:37,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:34:37,999 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 50 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:38,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 143 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:34:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:34:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-11-02 20:34:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-02 20:34:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-11-02 20:34:38,053 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 36 [2022-11-02 20:34:38,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:38,054 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-11-02 20:34:38,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:34:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-11-02 20:34:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:34:38,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:38,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:34:38,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:34:38,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1847691115, now seen corresponding path program 1 times [2022-11-02 20:34:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:38,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793282204] [2022-11-02 20:34:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:34:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:38,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:34:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:34:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:38,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:34:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:38,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:38,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793282204] [2022-11-02 20:34:38,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793282204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:38,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:38,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:34:38,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270567223] [2022-11-02 20:34:38,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:38,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:34:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:38,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:34:38,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:34:38,493 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:34:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:38,801 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2022-11-02 20:34:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:34:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-11-02 20:34:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:38,804 INFO L225 Difference]: With dead ends: 136 [2022-11-02 20:34:38,804 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 20:34:38,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:34:38,807 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 78 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:38,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 247 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:34:38,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 20:34:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2022-11-02 20:34:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-11-02 20:34:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2022-11-02 20:34:38,834 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 36 [2022-11-02 20:34:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:38,835 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2022-11-02 20:34:38,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:34:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2022-11-02 20:34:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:34:38,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:38,837 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-02 20:34:38,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:34:38,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:38,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash 289307572, now seen corresponding path program 1 times [2022-11-02 20:34:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:38,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146864055] [2022-11-02 20:34:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:34:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:34:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:39,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:39,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:34:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:39,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:34:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:39,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:34:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:34:39,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:39,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146864055] [2022-11-02 20:34:39,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146864055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:39,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350337837] [2022-11-02 20:34:39,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:39,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:39,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:39,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:39,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:34:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:39,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:34:39,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:34:39,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:34:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:34:39,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350337837] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:34:39,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:34:39,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2022-11-02 20:34:39,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938536853] [2022-11-02 20:34:39,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:34:39,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:34:39,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:39,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:34:39,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:34:39,822 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-02 20:34:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:40,380 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2022-11-02 20:34:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:34:40,381 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2022-11-02 20:34:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:40,383 INFO L225 Difference]: With dead ends: 142 [2022-11-02 20:34:40,383 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 20:34:40,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:34:40,385 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 35 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:40,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 395 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:34:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 20:34:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-11-02 20:34:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 53 states have internal predecessors, (59), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2022-11-02 20:34:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2022-11-02 20:34:40,399 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 48 [2022-11-02 20:34:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:40,399 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2022-11-02 20:34:40,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-02 20:34:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2022-11-02 20:34:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:34:40,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:40,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-02 20:34:40,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:40,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-02 20:34:40,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1954582857, now seen corresponding path program 1 times [2022-11-02 20:34:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:40,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270654575] [2022-11-02 20:34:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:40,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:40,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:40,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:40,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:34:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:40,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:34:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:34:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:34:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:34:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:34:41,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:41,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270654575] [2022-11-02 20:34:41,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270654575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:41,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:41,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:34:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243222181] [2022-11-02 20:34:41,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:41,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:34:41,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:41,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:34:41,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:34:41,067 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:34:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:41,516 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2022-11-02 20:34:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:34:41,517 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2022-11-02 20:34:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:41,519 INFO L225 Difference]: With dead ends: 142 [2022-11-02 20:34:41,519 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:34:41,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:34:41,521 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 107 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:41,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 346 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:34:41,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:34:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2022-11-02 20:34:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 55 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2022-11-02 20:34:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2022-11-02 20:34:41,535 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 58 [2022-11-02 20:34:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:41,536 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2022-11-02 20:34:41,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:34:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2022-11-02 20:34:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 20:34:41,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:41,538 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-11-02 20:34:41,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:34:41,539 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:41,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1575743044, now seen corresponding path program 1 times [2022-11-02 20:34:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:41,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147439321] [2022-11-02 20:34:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:34:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:34:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:34:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:34:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:34:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:34:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-02 20:34:42,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:42,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147439321] [2022-11-02 20:34:42,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147439321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:34:42,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101358820] [2022-11-02 20:34:42,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:42,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:42,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:42,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:34:42,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:34:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:42,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:34:42,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:34:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:34:42,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:34:42,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101358820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:42,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:34:42,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2022-11-02 20:34:42,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103004265] [2022-11-02 20:34:42,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:42,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:34:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:42,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:34:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:34:42,282 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:34:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:42,440 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2022-11-02 20:34:42,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:34:42,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 71 [2022-11-02 20:34:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:42,446 INFO L225 Difference]: With dead ends: 133 [2022-11-02 20:34:42,446 INFO L226 Difference]: Without dead ends: 84 [2022-11-02 20:34:42,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:34:42,452 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 48 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:42,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 508 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:34:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-02 20:34:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-02 20:34:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2022-11-02 20:34:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2022-11-02 20:34:42,482 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 71 [2022-11-02 20:34:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:42,483 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2022-11-02 20:34:42,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:34:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2022-11-02 20:34:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:34:42,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:42,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-02 20:34:42,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:34:42,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:34:42,686 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:42,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1969188871, now seen corresponding path program 1 times [2022-11-02 20:34:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:42,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438760728] [2022-11-02 20:34:42,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:34:42,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:34:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:34:42,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:34:42,822 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:34:42,823 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:34:42,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:34:42,829 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-02 20:34:42,833 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:34:42,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:34:42 BoogieIcfgContainer [2022-11-02 20:34:42,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:34:42,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:34:42,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:34:42,920 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:34:42,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:34:37" (3/4) ... [2022-11-02 20:34:42,922 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:34:42,990 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:34:42,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:34:42,991 INFO L158 Benchmark]: Toolchain (without parser) took 7017.42ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 77.9MB in the beginning and 68.3MB in the end (delta: 9.6MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2022-11-02 20:34:42,991 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:34:42,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.30ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 84.1MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:34:42,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.07ms. Allocated memory is still 111.1MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:34:42,992 INFO L158 Benchmark]: Boogie Preprocessor took 52.09ms. Allocated memory is still 111.1MB. Free memory was 82.0MB in the beginning and 80.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:34:42,993 INFO L158 Benchmark]: RCFGBuilder took 611.11ms. Allocated memory is still 111.1MB. Free memory was 80.3MB in the beginning and 59.7MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 20:34:42,993 INFO L158 Benchmark]: TraceAbstraction took 5860.37ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 58.9MB in the beginning and 72.5MB in the end (delta: -13.6MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-11-02 20:34:42,993 INFO L158 Benchmark]: Witness Printer took 70.54ms. Allocated memory is still 134.2MB. Free memory was 72.5MB in the beginning and 68.3MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:34:42,995 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.29ms. Allocated memory is still 88.1MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.30ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 84.1MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.07ms. Allocated memory is still 111.1MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.09ms. Allocated memory is still 111.1MB. Free memory was 82.0MB in the beginning and 80.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.11ms. Allocated memory is still 111.1MB. Free memory was 80.3MB in the beginning and 59.7MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5860.37ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 58.9MB in the beginning and 72.5MB in the end (delta: -13.6MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Witness Printer took 70.54ms. Allocated memory is still 134.2MB. Free memory was 72.5MB in the beginning and 68.3MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L105] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-2:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-2:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}, n={-2:0}] [L105] RET, EXPR nondet_tree() VAL [nondet_tree()={-2:0}] [L105] CALL task(nondet_tree()) [L83] CALL, EXPR min(t) VAL [n={-2:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-2:0}, n={-2:0}, n->left={0:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-2:0}, n={-2:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-2:0}, n={-2:0}] [L83] RET, EXPR min(t) VAL [min(t)=2147483647, t={-2:0}, t={-2:0}] [L83] int a = min(t); [L84] int b; VAL [a=2147483647, b={5:0}, t={-2:0}, t={-2:0}] [L86] CALL, EXPR size(t) VAL [t={-2:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L79] CALL, EXPR size(t->left) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L79] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] CALL, EXPR size(t->right) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-2:0}, t={-2:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}] [L88] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}] [L89] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L89] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, tree_inorder(t, x, n)=2, x={-3:0}] [L90] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}, x[0]=0] [L90] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 1639 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1215 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1121 IncrementalHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 424 mSDtfsCounter, 1121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1179 SizeOfPredicates, 10 NumberOfNonLiveVariables, 635 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 115/123 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:34:43,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c48292ff-d02e-44c9-80bd-63d6b041398c/bin/uautomizer-Dbtcem3rbc/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE