./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP --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 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:04:37,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:04:37,632 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:04:37,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:04:37,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:04:37,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:04:37,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:04:37,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:04:37,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:04:37,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:04:37,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:04:37,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:04:37,692 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:04:37,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:04:37,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:04:37,694 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:04:37,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:04:37,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:04:37,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:04:37,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:04:37,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:04:37,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:04:37,698 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:04:37,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:04:37,699 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:04:37,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:04:37,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:04:37,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:04:37,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:37,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:04:37,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:04:37,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:04:37,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:04:37,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:04:37,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:04:37,704 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:04:37,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:04:37,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:04:37,704 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:04:37,704 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/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_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP 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 -> 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 [2023-11-06 23:04:38,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:04:38,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:04:38,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:04:38,066 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:04:38,069 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:04:38,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2023-11-06 23:04:41,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:04:41,468 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:04:41,469 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2023-11-06 23:04:41,477 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/data/2a7f33345/f47ccf71e5c848db84a7e4d49a71361a/FLAG569844ade [2023-11-06 23:04:41,501 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/data/2a7f33345/f47ccf71e5c848db84a7e4d49a71361a [2023-11-06 23:04:41,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:04:41,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:04:41,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:41,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:04:41,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:04:41,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67eac7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41, skipping insertion in model container [2023-11-06 23:04:41,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,566 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:04:41,758 WARN L240 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_e8a94e46-0aca-4877-848d-452759f69baa/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2023-11-06 23:04:41,773 WARN L1577 CHandler]: Possible shadowing of function min [2023-11-06 23:04:41,775 WARN L1577 CHandler]: Possible shadowing of function min [2023-11-06 23:04:41,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:41,805 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:04:41,819 WARN L240 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_e8a94e46-0aca-4877-848d-452759f69baa/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2023-11-06 23:04:41,824 WARN L1577 CHandler]: Possible shadowing of function min [2023-11-06 23:04:41,826 WARN L1577 CHandler]: Possible shadowing of function min [2023-11-06 23:04:41,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:41,866 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:04:41,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41 WrapperNode [2023-11-06 23:04:41,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:41,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:41,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:04:41,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:04:41,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,923 INFO L138 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2023-11-06 23:04:41,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:41,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:04:41,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:04:41,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:04:41,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:04:41,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:04:41,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:04:41,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:04:41,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (1/1) ... [2023-11-06 23:04:41,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:41,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:42,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:04:42,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:04:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:04:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:04:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 23:04:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2023-11-06 23:04:42,044 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2023-11-06 23:04:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:04:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-11-06 23:04:42,044 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-11-06 23:04:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:04:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-06 23:04:42,045 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-06 23:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 23:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-11-06 23:04:42,045 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-11-06 23:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:04:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 23:04:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-11-06 23:04:42,046 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-11-06 23:04:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:04:42,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:04:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 23:04:42,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 23:04:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-11-06 23:04:42,047 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-11-06 23:04:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:04:42,163 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:04:42,166 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:04:42,551 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:04:42,560 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:04:42,560 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:04:42,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:42 BoogieIcfgContainer [2023-11-06 23:04:42,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:04:42,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:04:42,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:04:42,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:04:42,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:04:41" (1/3) ... [2023-11-06 23:04:42,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b66889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:42, skipping insertion in model container [2023-11-06 23:04:42,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:41" (2/3) ... [2023-11-06 23:04:42,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b66889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:42, skipping insertion in model container [2023-11-06 23:04:42,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:42" (3/3) ... [2023-11-06 23:04:42,574 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2023-11-06 23:04:42,595 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:04:42,596 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:04:42,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:04:42,664 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;@3a95557b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:04:42,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:04:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 55 states have internal predecessors, (65), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 23:04:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 23:04:42,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:42,683 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, 1] [2023-11-06 23:04:42,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:42,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1466411597, now seen corresponding path program 1 times [2023-11-06 23:04:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261295142] [2023-11-06 23:04:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:42,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:04:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 23:04:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 23:04:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:04:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:43,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:43,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261295142] [2023-11-06 23:04:43,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261295142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:43,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:43,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:04:43,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700556170] [2023-11-06 23:04:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:43,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:43,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:43,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:43,192 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 55 states have internal predecessors, (65), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 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) [2023-11-06 23:04:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:43,601 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2023-11-06 23:04:43,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:43,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 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 37 [2023-11-06 23:04:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:43,621 INFO L225 Difference]: With dead ends: 149 [2023-11-06 23:04:43,623 INFO L226 Difference]: Without dead ends: 85 [2023-11-06 23:04:43,629 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 [2023-11-06 23:04:43,635 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 60 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:43,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 121 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:04:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-06 23:04:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2023-11-06 23:04:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 23:04:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2023-11-06 23:04:43,724 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 37 [2023-11-06 23:04:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:43,726 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2023-11-06 23:04:43,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 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) [2023-11-06 23:04:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2023-11-06 23:04:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 23:04:43,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:43,734 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, 1] [2023-11-06 23:04:43,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:04:43,735 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:43,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1240207797, now seen corresponding path program 1 times [2023-11-06 23:04:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582858209] [2023-11-06 23:04:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:04:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 23:04:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 23:04:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:04:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:44,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:44,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582858209] [2023-11-06 23:04:44,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582858209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:44,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:44,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:04:44,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640498869] [2023-11-06 23:04:44,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:44,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:04:44,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:44,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:04:44,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:44,166 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-11-06 23:04:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:44,533 INFO L93 Difference]: Finished difference Result 143 states and 185 transitions. [2023-11-06 23:04:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:04:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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 37 [2023-11-06 23:04:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:44,536 INFO L225 Difference]: With dead ends: 143 [2023-11-06 23:04:44,537 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 23:04:44,538 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 [2023-11-06 23:04:44,540 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:44,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 239 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:04:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 23:04:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2023-11-06 23:04:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2023-11-06 23:04:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2023-11-06 23:04:44,557 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 37 [2023-11-06 23:04:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:44,558 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2023-11-06 23:04:44,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-11-06 23:04:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2023-11-06 23:04:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-06 23:04:44,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:44,562 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, 1] [2023-11-06 23:04:44,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:04:44,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:44,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1995642374, now seen corresponding path program 1 times [2023-11-06 23:04:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159335129] [2023-11-06 23:04:44,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:44,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:04:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 23:04:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:04:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:04:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 23:04:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:04:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159335129] [2023-11-06 23:04:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159335129] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276295084] [2023-11-06 23:04:44,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:44,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:44,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:44,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:45,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:04:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:45,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 23:04:45,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:04:45,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:04:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276295084] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:45,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2023-11-06 23:04:45,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575891587] [2023-11-06 23:04:45,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:45,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 23:04:45,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:45,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 23:04:45,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:04:45,612 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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) [2023-11-06 23:04:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:46,177 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2023-11-06 23:04:46,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:04:46,178 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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 49 [2023-11-06 23:04:46,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:46,180 INFO L225 Difference]: With dead ends: 149 [2023-11-06 23:04:46,180 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 23:04:46,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:04:46,183 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 45 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:46,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 401 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:04:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 23:04:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2023-11-06 23:04:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 54 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2023-11-06 23:04:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2023-11-06 23:04:46,197 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 49 [2023-11-06 23:04:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:46,197 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2023-11-06 23:04:46,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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) [2023-11-06 23:04:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2023-11-06 23:04:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 23:04:46,200 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:46,200 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 23:04:46,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:46,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:46,406 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:46,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1925714431, now seen corresponding path program 1 times [2023-11-06 23:04:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:46,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232719790] [2023-11-06 23:04:46,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:46,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:04:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 23:04:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 23:04:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:04:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 23:04:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 23:04:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 23:04:46,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:46,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232719790] [2023-11-06 23:04:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232719790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:46,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:46,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 23:04:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427294763] [2023-11-06 23:04:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:46,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:04:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:46,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:04:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:04:46,790 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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) [2023-11-06 23:04:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:47,292 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2023-11-06 23:04:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:04:47,293 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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 61 [2023-11-06 23:04:47,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:47,295 INFO L225 Difference]: With dead ends: 149 [2023-11-06 23:04:47,295 INFO L226 Difference]: Without dead ends: 89 [2023-11-06 23:04:47,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:04:47,297 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 103 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:47,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 360 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:04:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-06 23:04:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2023-11-06 23:04:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2023-11-06 23:04:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2023-11-06 23:04:47,313 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 61 [2023-11-06 23:04:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:47,313 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2023-11-06 23:04:47,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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) [2023-11-06 23:04:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2023-11-06 23:04:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-06 23:04:47,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:47,316 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 23:04:47,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:04:47,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:47,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash 759490109, now seen corresponding path program 1 times [2023-11-06 23:04:47,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:47,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886088598] [2023-11-06 23:04:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:04:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 23:04:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:04:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 23:04:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:04:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:04:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 23:04:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 23:04:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 23:04:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886088598] [2023-11-06 23:04:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886088598] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906752064] [2023-11-06 23:04:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:47,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:47,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:47,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:47,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:04:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:48,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 23:04:48,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-06 23:04:48,090 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:48,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906752064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:48,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:48,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2023-11-06 23:04:48,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381117138] [2023-11-06 23:04:48,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:48,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:04:48,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:48,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:04:48,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2023-11-06 23:04:48,094 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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) [2023-11-06 23:04:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:48,237 INFO L93 Difference]: Finished difference Result 140 states and 181 transitions. [2023-11-06 23:04:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:04:48,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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 74 [2023-11-06 23:04:48,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:48,239 INFO L225 Difference]: With dead ends: 140 [2023-11-06 23:04:48,240 INFO L226 Difference]: Without dead ends: 88 [2023-11-06 23:04:48,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:04:48,242 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 36 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:48,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 576 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-06 23:04:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-06 23:04:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2023-11-06 23:04:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2023-11-06 23:04:48,262 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 74 [2023-11-06 23:04:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:48,265 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2023-11-06 23:04:48,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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) [2023-11-06 23:04:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2023-11-06 23:04:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 23:04:48,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:48,273 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 23:04:48,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:48,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:48,480 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:48,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash 353794128, now seen corresponding path program 1 times [2023-11-06 23:04:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:48,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187820739] [2023-11-06 23:04:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:04:48,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:04:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:04:48,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:04:48,642 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:04:48,643 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:04:48,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:04:48,649 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 23:04:48,655 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:04:48,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:04:48 BoogieIcfgContainer [2023-11-06 23:04:48,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:04:48,734 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:04:48,734 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:04:48,735 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:04:48,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:42" (3/4) ... [2023-11-06 23:04:48,736 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 23:04:48,799 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:04:48,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:04:48,800 INFO L158 Benchmark]: Toolchain (without parser) took 7287.97ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 102.6MB in the beginning and 97.7MB in the end (delta: 4.9MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2023-11-06 23:04:48,801 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 148.9MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:04:48,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.08ms. Allocated memory is still 148.9MB. Free memory was 102.6MB in the beginning and 90.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:04:48,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.98ms. Allocated memory is still 148.9MB. Free memory was 90.0MB in the beginning and 88.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:48,802 INFO L158 Benchmark]: Boogie Preprocessor took 52.73ms. Allocated memory is still 148.9MB. Free memory was 88.3MB in the beginning and 86.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:04:48,803 INFO L158 Benchmark]: RCFGBuilder took 584.99ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 86.5MB in the beginning and 153.2MB in the end (delta: -66.7MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2023-11-06 23:04:48,803 INFO L158 Benchmark]: TraceAbstraction took 6167.31ms. Allocated memory is still 186.6MB. Free memory was 152.2MB in the beginning and 100.9MB in the end (delta: 51.3MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:48,804 INFO L158 Benchmark]: Witness Printer took 65.52ms. Allocated memory is still 186.6MB. Free memory was 100.9MB in the beginning and 97.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:04:48,806 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 148.9MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.08ms. Allocated memory is still 148.9MB. Free memory was 102.6MB in the beginning and 90.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.98ms. Allocated memory is still 148.9MB. Free memory was 90.0MB in the beginning and 88.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.73ms. Allocated memory is still 148.9MB. Free memory was 88.3MB in the beginning and 86.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 584.99ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 86.5MB in the beginning and 153.2MB in the end (delta: -66.7MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6167.31ms. Allocated memory is still 186.6MB. Free memory was 152.2MB in the beginning and 100.9MB in the end (delta: 51.3MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. * Witness Printer took 65.52ms. Allocated memory is still 186.6MB. Free memory was 100.9MB in the beginning and 97.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: [L98] 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={-1: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={-1:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, n={-1:0}] [L98] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L98] CALL task(nondet_tree()) [L76] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n->left={0:0}, n={-1:0}, n={-1: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->left={0:0}, n={-1:0}, n={-1:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n->right={0:0}, n={-1:0}, n={-1: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->right={0:0}, n={-1:0}, n={-1:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-1:0}, n={-1:0}] [L76] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t) VAL [t={-1:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t->left={0:0}, t={-1:0}, t={-1:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t->left={0:0}, t={-1:0}, t={-1:0}] [L72] EXPR t->right VAL [size(t->left)=0, t->left={0:0}, t->right={0:0}, t={-1:0}, t={-1:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t->left={0:0}, t->right={0:0}, t={-1:0}, t={-1:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-1:0}, t={-1:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_abort_if_not(n != 0) [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-1:0}, t={-1:0}] [L81] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-1:0}, t={-1:0}, x={-3:0}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-1:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t->left={0:0}, t={-1:0}, t={-1:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t->left={0:0}, t={-1:0}, t={-1:0}, tree_inorder(t->left, a, i)=1] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t->right={0:0}, t={-1:0}, t={-1:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t->right={0:0}, t={-1:0}, t={-1:0}, tree_inorder(t->right, a, i)=2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-1:0}, t={-1:0}] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-3:0}] [L83] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-1:0}, t={-1:0}, x={-3:0}, x[0]=0] [L83] 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 8 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 1697 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1359 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1275 IncrementalHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 338 mSDtfsCounter, 1275 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred 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.4s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 1129 SizeOfPredicates, 10 NumberOfNonLiveVariables, 631 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 124/132 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! [2023-11-06 23:04:48,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a94e46-0aca-4877-848d-452759f69baa/bin/uautomizer-verify-WvqO1wxjHP/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