./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/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_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 --- 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 21:06:56,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:06:56,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:06:56,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:06:56,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:06:56,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:06:56,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:06:56,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:06:56,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:06:56,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:06:56,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:06:56,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:06:56,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:06:56,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:06:56,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:06:56,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:06:56,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:06:56,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:06:56,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:06:56,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:06:56,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:06:56,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:06:56,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:06:56,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:06:56,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:06:56,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:06:56,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:06:56,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:06:56,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:06:56,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:06:56,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:06:56,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:06:56,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:06:56,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:06:56,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:06:56,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:06:56,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:06:56,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:06:56,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:06:56,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:06:56,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:06:56,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-02 21:06:56,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:06:56,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:06:56,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:06:56,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:06:56,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:06:56,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:06:56,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:06:56,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:06:56,799 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:06:56,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:06:56,801 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:06:56,801 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:06:56,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:06:56,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:06:56,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:06:56,803 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 21:06:56,803 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 21:06:56,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:06:56,803 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 21:06:56,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:06:56,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:06:56,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:06:56,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:06:56,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:06:56,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:06:56,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:06:56,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:06:56,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:06:56,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:06:56,808 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_f252a597-7e22-4287-875f-ec3616d8e412/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_f252a597-7e22-4287-875f-ec3616d8e412/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 valid-memcleanup) ) 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 -> 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 [2022-11-02 21:06:57,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:06:57,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:06:57,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:06:57,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:06:57,250 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:06:57,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2022-11-02 21:06:57,354 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/data/9a57b2ca5/cec3a88966234fe8aca8c888e672da9e/FLAG80c27956b [2022-11-02 21:06:57,866 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:06:57,867 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2022-11-02 21:06:57,877 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/data/9a57b2ca5/cec3a88966234fe8aca8c888e672da9e/FLAG80c27956b [2022-11-02 21:06:58,171 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/data/9a57b2ca5/cec3a88966234fe8aca8c888e672da9e [2022-11-02 21:06:58,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:06:58,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:06:58,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:06:58,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:06:58,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:06:58,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32719e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58, skipping insertion in model container [2022-11-02 21:06:58,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:06:58,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:06:58,627 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_f252a597-7e22-4287-875f-ec3616d8e412/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2022-11-02 21:06:58,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:06:58,651 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:06:58,711 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_f252a597-7e22-4287-875f-ec3616d8e412/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2022-11-02 21:06:58,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:06:58,746 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:06:58,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58 WrapperNode [2022-11-02 21:06:58,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:06:58,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:06:58,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:06:58,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:06:58,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,812 INFO L138 Inliner]: procedures = 123, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-11-02 21:06:58,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:06:58,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:06:58,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:06:58,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:06:58,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,865 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:06:58,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:06:58,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:06:58,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:06:58,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:06:58,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:58,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:06:58,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:06:58,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:06:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:06:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:06:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:06:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:06:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:06:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:06:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:06:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:06:58,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:06:59,070 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:06:59,072 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:06:59,515 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:06:59,523 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:06:59,523 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 21:06:59,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:06:59 BoogieIcfgContainer [2022-11-02 21:06:59,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:06:59,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:06:59,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:06:59,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:06:59,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:06:58" (1/3) ... [2022-11-02 21:06:59,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42307b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:06:59, skipping insertion in model container [2022-11-02 21:06:59,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58" (2/3) ... [2022-11-02 21:06:59,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42307b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:06:59, skipping insertion in model container [2022-11-02 21:06:59,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:06:59" (3/3) ... [2022-11-02 21:06:59,542 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2022-11-02 21:06:59,564 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:06:59,564 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-11-02 21:06:59,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:06:59,624 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@5ba0c8fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:06:59,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-11-02 21:06:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 21:06:59,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:59,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 21:06:59,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:06:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2022-11-02 21:06:59,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:59,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003000371] [2022-11-02 21:06:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:59,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:00,024 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 21:07:00,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:00,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003000371] [2022-11-02 21:07:00,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003000371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:00,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:00,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:00,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191091741] [2022-11-02 21:07:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:00,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:00,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:00,076 INFO L87 Difference]: Start difference. First operand has 88 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:00,327 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2022-11-02 21:07:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 21:07:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:00,345 INFO L225 Difference]: With dead ends: 144 [2022-11-02 21:07:00,345 INFO L226 Difference]: Without dead ends: 139 [2022-11-02 21:07:00,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:00,350 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 88 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:00,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 168 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-02 21:07:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 80. [2022-11-02 21:07:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.78) internal successors, (89), 79 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-11-02 21:07:00,393 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2022-11-02 21:07:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:00,394 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-11-02 21:07:00,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-11-02 21:07:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 21:07:00,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:00,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 21:07:00,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:07:00,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:00,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2022-11-02 21:07:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:00,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464870800] [2022-11-02 21:07:00,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:00,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:00,592 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 21:07:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:00,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464870800] [2022-11-02 21:07:00,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464870800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:00,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:00,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:00,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336903113] [2022-11-02 21:07:00,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:00,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:00,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:00,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:00,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:00,599 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:00,719 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-11-02 21:07:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 21:07:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:00,721 INFO L225 Difference]: With dead ends: 134 [2022-11-02 21:07:00,722 INFO L226 Difference]: Without dead ends: 134 [2022-11-02 21:07:00,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:00,723 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 80 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:00,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-02 21:07:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 75. [2022-11-02 21:07:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.68) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-11-02 21:07:00,732 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 5 [2022-11-02 21:07:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:00,733 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-11-02 21:07:00,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-11-02 21:07:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 21:07:00,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:00,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 21:07:00,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:07:00,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:00,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:00,736 INFO L85 PathProgramCache]: Analyzing trace with hash 889673528, now seen corresponding path program 1 times [2022-11-02 21:07:00,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:00,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333620978] [2022-11-02 21:07:00,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:00,807 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 21:07:00,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:00,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333620978] [2022-11-02 21:07:00,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333620978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:00,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:00,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:00,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231109051] [2022-11-02 21:07:00,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:00,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:00,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:00,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:00,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:00,811 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:00,842 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-11-02 21:07:00,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:00,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 21:07:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:00,847 INFO L225 Difference]: With dead ends: 90 [2022-11-02 21:07:00,848 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 21:07:00,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:00,850 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:00,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 158 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:07:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 21:07:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2022-11-02 21:07:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-02 21:07:00,858 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 6 [2022-11-02 21:07:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:00,858 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-02 21:07:00,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-02 21:07:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:07:00,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:00,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:00,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:07:00,860 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:00,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1959623991, now seen corresponding path program 1 times [2022-11-02 21:07:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:00,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223910850] [2022-11-02 21:07:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:01,048 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 21:07:01,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:01,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223910850] [2022-11-02 21:07:01,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223910850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:01,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:01,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:01,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641994119] [2022-11-02 21:07:01,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:01,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:01,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:01,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:01,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:01,051 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:01,092 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2022-11-02 21:07:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:01,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:07:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:01,094 INFO L225 Difference]: With dead ends: 87 [2022-11-02 21:07:01,094 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 21:07:01,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:01,096 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:01,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 157 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:07:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 21:07:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-11-02 21:07:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-11-02 21:07:01,103 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 14 [2022-11-02 21:07:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:01,104 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-11-02 21:07:01,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-11-02 21:07:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:07:01,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:01,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:01,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:07:01,122 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:01,123 INFO L85 PathProgramCache]: Analyzing trace with hash 866232140, now seen corresponding path program 1 times [2022-11-02 21:07:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:01,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675245888] [2022-11-02 21:07:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:01,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:01,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675245888] [2022-11-02 21:07:01,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675245888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:01,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049743206] [2022-11-02 21:07:01,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:01,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:01,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:01,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:01,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:07:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:01,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:07:01,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:01,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:01,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049743206] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:01,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:01,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 21:07:01,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107196180] [2022-11-02 21:07:01,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:01,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:01,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:01,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:01,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:01,563 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:01,632 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-11-02 21:07:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:01,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 21:07:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:01,640 INFO L225 Difference]: With dead ends: 118 [2022-11-02 21:07:01,640 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 21:07:01,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:01,642 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 66 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:01,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 249 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:07:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 21:07:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2022-11-02 21:07:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2022-11-02 21:07:01,651 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 18 [2022-11-02 21:07:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:01,652 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2022-11-02 21:07:01,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2022-11-02 21:07:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:07:01,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:01,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:01,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:01,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:01,874 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:01,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash 829454667, now seen corresponding path program 1 times [2022-11-02 21:07:01,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:01,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481048848] [2022-11-02 21:07:01,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:02,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481048848] [2022-11-02 21:07:02,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481048848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:02,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821680656] [2022-11-02 21:07:02,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:02,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:02,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:02,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:02,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:07:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:02,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 21:07:02,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:02,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:07:02,507 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:07:02,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 21:07:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:02,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:02,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821680656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:02,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:02,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-02 21:07:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504124142] [2022-11-02 21:07:02,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:02,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:02,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:02,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:02,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:02,814 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:02,934 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2022-11-02 21:07:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 21:07:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:02,936 INFO L225 Difference]: With dead ends: 145 [2022-11-02 21:07:02,936 INFO L226 Difference]: Without dead ends: 145 [2022-11-02 21:07:02,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:07:02,938 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 156 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:02,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 182 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-11-02 21:07:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-02 21:07:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 113. [2022-11-02 21:07:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 89 states have (on average 1.449438202247191) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2022-11-02 21:07:02,948 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 26 [2022-11-02 21:07:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:02,948 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2022-11-02 21:07:02,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2022-11-02 21:07:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:07:02,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:02,950 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:03,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:03,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:03,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash 829454668, now seen corresponding path program 1 times [2022-11-02 21:07:03,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:03,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088684739] [2022-11-02 21:07:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:03,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:03,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088684739] [2022-11-02 21:07:03,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088684739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:03,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715703581] [2022-11-02 21:07:03,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:03,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:03,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:03,610 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:03,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:07:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:03,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 21:07:03,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:03,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:07:03,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:03,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 21:07:03,900 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:03,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:07:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:03,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:04,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-11-02 21:07:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:04,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715703581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:04,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:04,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-02 21:07:04,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336850491] [2022-11-02 21:07:04,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:04,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:07:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:04,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:07:04,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:07:04,475 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:04,662 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2022-11-02 21:07:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:04,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 21:07:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:04,664 INFO L225 Difference]: With dead ends: 147 [2022-11-02 21:07:04,664 INFO L226 Difference]: Without dead ends: 147 [2022-11-02 21:07:04,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:07:04,665 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 628 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:04,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 100 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2022-11-02 21:07:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-02 21:07:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 112. [2022-11-02 21:07:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-11-02 21:07:04,673 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 26 [2022-11-02 21:07:04,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:04,679 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-11-02 21:07:04,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-11-02 21:07:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 21:07:04,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:04,681 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:04,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:04,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:04,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:04,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:04,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1598053496, now seen corresponding path program 2 times [2022-11-02 21:07:04,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:04,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760164280] [2022-11-02 21:07:04,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:04,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 21:07:05,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:05,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760164280] [2022-11-02 21:07:05,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760164280] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:05,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089457266] [2022-11-02 21:07:05,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:07:05,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:05,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:05,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:05,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:07:05,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:07:05,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:05,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 21:07:05,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:05,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:05,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089457266] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:05,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:05,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2022-11-02 21:07:05,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565385451] [2022-11-02 21:07:05,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:05,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:07:05,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:05,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:07:05,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:05,465 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:05,670 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2022-11-02 21:07:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:07:05,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-02 21:07:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:05,672 INFO L225 Difference]: With dead ends: 125 [2022-11-02 21:07:05,672 INFO L226 Difference]: Without dead ends: 125 [2022-11-02 21:07:05,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:07:05,673 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 219 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:05,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 275 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:05,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-02 21:07:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-02 21:07:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2022-11-02 21:07:05,681 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 54 [2022-11-02 21:07:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:05,682 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2022-11-02 21:07:05,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2022-11-02 21:07:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-02 21:07:05,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:05,685 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:05,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:05,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 21:07:05,902 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:05,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:05,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1121714636, now seen corresponding path program 1 times [2022-11-02 21:07:05,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:05,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136165651] [2022-11-02 21:07:05,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:05,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-02 21:07:06,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:06,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136165651] [2022-11-02 21:07:06,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136165651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:06,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:06,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352911807] [2022-11-02 21:07:06,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:06,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:06,510 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:06,756 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2022-11-02 21:07:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:06,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-11-02 21:07:06,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:06,758 INFO L225 Difference]: With dead ends: 171 [2022-11-02 21:07:06,758 INFO L226 Difference]: Without dead ends: 171 [2022-11-02 21:07:06,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:06,759 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 410 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:06,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 91 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-02 21:07:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2022-11-02 21:07:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 181 transitions. [2022-11-02 21:07:06,767 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 181 transitions. Word has length 70 [2022-11-02 21:07:06,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:06,768 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 181 transitions. [2022-11-02 21:07:06,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 181 transitions. [2022-11-02 21:07:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-02 21:07:06,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:06,770 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:06,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:07:06,771 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:06,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:06,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1121714635, now seen corresponding path program 1 times [2022-11-02 21:07:06,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:06,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373719037] [2022-11-02 21:07:06,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:06,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:07,099 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-02 21:07:07,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:07,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373719037] [2022-11-02 21:07:07,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373719037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:07,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:07,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:07,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120244653] [2022-11-02 21:07:07,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:07,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:07,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:07,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:07,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:07,103 INFO L87 Difference]: Start difference. First operand 152 states and 181 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:07,316 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2022-11-02 21:07:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:07:07,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-11-02 21:07:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:07,320 INFO L225 Difference]: With dead ends: 171 [2022-11-02 21:07:07,321 INFO L226 Difference]: Without dead ends: 171 [2022-11-02 21:07:07,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:07,322 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 252 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:07,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 122 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-02 21:07:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2022-11-02 21:07:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.282442748091603) internal successors, (168), 145 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 168 transitions. [2022-11-02 21:07:07,342 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 168 transitions. Word has length 70 [2022-11-02 21:07:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:07,345 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 168 transitions. [2022-11-02 21:07:07,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2022-11-02 21:07:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 21:07:07,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:07,353 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:07,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:07:07,354 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1909311012, now seen corresponding path program 1 times [2022-11-02 21:07:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:07,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121053090] [2022-11-02 21:07:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-02 21:07:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121053090] [2022-11-02 21:07:07,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121053090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:07,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:07,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:07:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290188946] [2022-11-02 21:07:07,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:07,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:07,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:07,609 INFO L87 Difference]: Start difference. First operand 146 states and 168 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:07,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:07,765 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2022-11-02 21:07:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:07,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-02 21:07:07,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:07,767 INFO L225 Difference]: With dead ends: 152 [2022-11-02 21:07:07,767 INFO L226 Difference]: Without dead ends: 152 [2022-11-02 21:07:07,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:07,768 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 333 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:07,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 116 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-02 21:07:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2022-11-02 21:07:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 145 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2022-11-02 21:07:07,772 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 74 [2022-11-02 21:07:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:07,773 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2022-11-02 21:07:07,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2022-11-02 21:07:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 21:07:07,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:07,774 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:07,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:07:07,775 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:07,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash -522705552, now seen corresponding path program 1 times [2022-11-02 21:07:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:07,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602889012] [2022-11-02 21:07:07,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:07,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-02 21:07:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:08,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602889012] [2022-11-02 21:07:08,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602889012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:08,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938475034] [2022-11-02 21:07:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:08,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:08,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:08,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:08,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:07:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 21:07:09,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:09,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:07:09,251 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:09,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:07:09,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:07:09,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:09,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:07:09,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:09,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:09,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 21:07:09,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:09,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:09,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 21:07:09,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:09,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:09,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 21:07:09,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-02 21:07:09,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:09,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 21:07:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 21:07:09,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:09,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-11-02 21:07:09,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1546 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-11-02 21:07:09,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1545 Int) (v_ArrVal_1546 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1545) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-11-02 21:07:09,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1545 Int) (v_ArrVal_1546 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1543) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1545) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-11-02 21:07:09,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1545 Int) (v_ArrVal_1546 Int)) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1543) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1545) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2022-11-02 21:07:09,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:09,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 59 [2022-11-02 21:07:09,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:09,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2022-11-02 21:07:09,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 21:07:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 9 not checked. [2022-11-02 21:07:09,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938475034] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:09,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:09,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 26 [2022-11-02 21:07:09,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861969169] [2022-11-02 21:07:09,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:09,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 21:07:09,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:09,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 21:07:09,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=367, Unknown=5, NotChecked=210, Total=650 [2022-11-02 21:07:09,829 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:10,968 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2022-11-02 21:07:10,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 21:07:10,969 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-02 21:07:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:10,970 INFO L225 Difference]: With dead ends: 185 [2022-11-02 21:07:10,970 INFO L226 Difference]: Without dead ends: 185 [2022-11-02 21:07:10,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=395, Invalid=1260, Unknown=5, NotChecked=410, Total=2070 [2022-11-02 21:07:10,972 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 638 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 511 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:10,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 560 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 491 Invalid, 0 Unknown, 511 Unchecked, 0.4s Time] [2022-11-02 21:07:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-02 21:07:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 146. [2022-11-02 21:07:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 145 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2022-11-02 21:07:10,978 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 78 [2022-11-02 21:07:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:10,978 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2022-11-02 21:07:10,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2022-11-02 21:07:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 21:07:10,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:10,980 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:11,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-02 21:07:11,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 21:07:11,203 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1817927893, now seen corresponding path program 1 times [2022-11-02 21:07:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:11,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089706680] [2022-11-02 21:07:11,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 65 proven. 44 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 21:07:12,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:12,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089706680] [2022-11-02 21:07:12,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089706680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:12,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862358822] [2022-11-02 21:07:12,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:12,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:12,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:12,654 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:12,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:07:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:13,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-02 21:07:13,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:13,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:07:13,059 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:13,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:07:13,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:13,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:07:13,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:07:13,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:07:13,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:07:13,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:07:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 21:07:13,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:13,950 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:13,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 43 [2022-11-02 21:07:13,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-02 21:07:13,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 21:07:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 21:07:14,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862358822] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:14,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:14,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 31 [2022-11-02 21:07:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243854525] [2022-11-02 21:07:14,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:14,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 21:07:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:14,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 21:07:14,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=819, Unknown=5, NotChecked=0, Total=930 [2022-11-02 21:07:14,087 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:15,024 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2022-11-02 21:07:15,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:07:15,025 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 21:07:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:15,026 INFO L225 Difference]: With dead ends: 177 [2022-11-02 21:07:15,026 INFO L226 Difference]: Without dead ends: 177 [2022-11-02 21:07:15,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=366, Invalid=1521, Unknown=5, NotChecked=0, Total=1892 [2022-11-02 21:07:15,028 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 772 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:15,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 516 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 477 Invalid, 0 Unknown, 17 Unchecked, 0.5s Time] [2022-11-02 21:07:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-02 21:07:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 146. [2022-11-02 21:07:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 145 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 165 transitions. [2022-11-02 21:07:15,032 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 165 transitions. Word has length 80 [2022-11-02 21:07:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:15,033 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 165 transitions. [2022-11-02 21:07:15,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 165 transitions. [2022-11-02 21:07:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-02 21:07:15,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:15,039 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:15,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:15,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 21:07:15,255 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:15,256 INFO L85 PathProgramCache]: Analyzing trace with hash 182605743, now seen corresponding path program 1 times [2022-11-02 21:07:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:15,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348305075] [2022-11-02 21:07:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-02 21:07:16,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:16,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348305075] [2022-11-02 21:07:16,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348305075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:16,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988051207] [2022-11-02 21:07:16,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:16,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:16,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:16,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:16,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 21:07:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:16,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 21:07:16,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:16,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:07:16,805 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:16,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:07:16,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:16,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 21:07:16,961 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:16,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-02 21:07:17,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:17,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2022-11-02 21:07:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 21:07:17,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:17,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:17,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-02 21:07:17,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:17,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-11-02 21:07:17,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 21:07:17,883 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:07:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 21:07:18,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988051207] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:18,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:18,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2022-11-02 21:07:18,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397943746] [2022-11-02 21:07:18,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:18,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 21:07:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:18,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 21:07:18,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=901, Unknown=5, NotChecked=0, Total=992 [2022-11-02 21:07:18,334 INFO L87 Difference]: Start difference. First operand 146 states and 165 transitions. Second operand has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:19,770 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2022-11-02 21:07:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 21:07:19,771 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-11-02 21:07:19,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:19,772 INFO L225 Difference]: With dead ends: 164 [2022-11-02 21:07:19,772 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 21:07:19,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=376, Invalid=2169, Unknown=5, NotChecked=0, Total=2550 [2022-11-02 21:07:19,774 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 577 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:19,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 781 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 547 Invalid, 0 Unknown, 150 Unchecked, 0.6s Time] [2022-11-02 21:07:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 21:07:19,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2022-11-02 21:07:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 131 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2022-11-02 21:07:19,779 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 81 [2022-11-02 21:07:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:19,779 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2022-11-02 21:07:19,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2022-11-02 21:07:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-02 21:07:19,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:19,781 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:19,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:20,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 21:07:20,006 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2022-11-02 21:07:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1021407014, now seen corresponding path program 1 times [2022-11-02 21:07:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:20,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86331634] [2022-11-02 21:07:20,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:20,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:20,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:07:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:20,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:07:20,296 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:07:20,297 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (34 of 35 remaining) [2022-11-02 21:07:20,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 35 remaining) [2022-11-02 21:07:20,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 35 remaining) [2022-11-02 21:07:20,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 35 remaining) [2022-11-02 21:07:20,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 35 remaining) [2022-11-02 21:07:20,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 35 remaining) [2022-11-02 21:07:20,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 35 remaining) [2022-11-02 21:07:20,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 35 remaining) [2022-11-02 21:07:20,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 35 remaining) [2022-11-02 21:07:20,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 35 remaining) [2022-11-02 21:07:20,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 35 remaining) [2022-11-02 21:07:20,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 35 remaining) [2022-11-02 21:07:20,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 35 remaining) [2022-11-02 21:07:20,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 35 remaining) [2022-11-02 21:07:20,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 35 remaining) [2022-11-02 21:07:20,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 35 remaining) [2022-11-02 21:07:20,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 35 remaining) [2022-11-02 21:07:20,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 35 remaining) [2022-11-02 21:07:20,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 35 remaining) [2022-11-02 21:07:20,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 35 remaining) [2022-11-02 21:07:20,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 35 remaining) [2022-11-02 21:07:20,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 35 remaining) [2022-11-02 21:07:20,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 35 remaining) [2022-11-02 21:07:20,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 35 remaining) [2022-11-02 21:07:20,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 35 remaining) [2022-11-02 21:07:20,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 35 remaining) [2022-11-02 21:07:20,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 35 remaining) [2022-11-02 21:07:20,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 35 remaining) [2022-11-02 21:07:20,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 35 remaining) [2022-11-02 21:07:20,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 35 remaining) [2022-11-02 21:07:20,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 35 remaining) [2022-11-02 21:07:20,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (3 of 35 remaining) [2022-11-02 21:07:20,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (2 of 35 remaining) [2022-11-02 21:07:20,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (1 of 35 remaining) [2022-11-02 21:07:20,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (0 of 35 remaining) [2022-11-02 21:07:20,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:07:20,315 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:20,321 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:07:20,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:07:20 BoogieIcfgContainer [2022-11-02 21:07:20,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:07:20,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:07:20,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:07:20,408 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:07:20,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:06:59" (3/4) ... [2022-11-02 21:07:20,410 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 21:07:20,487 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:07:20,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:07:20,488 INFO L158 Benchmark]: Toolchain (without parser) took 22312.31ms. Allocated memory was 144.7MB in the beginning and 369.1MB in the end (delta: 224.4MB). Free memory was 104.7MB in the beginning and 254.9MB in the end (delta: -150.2MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2022-11-02 21:07:20,489 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 144.7MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:07:20,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.31ms. Allocated memory is still 144.7MB. Free memory was 104.5MB in the beginning and 111.7MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 21:07:20,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.98ms. Allocated memory is still 144.7MB. Free memory was 111.7MB in the beginning and 109.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:07:20,491 INFO L158 Benchmark]: Boogie Preprocessor took 54.29ms. Allocated memory is still 144.7MB. Free memory was 109.6MB in the beginning and 108.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:07:20,492 INFO L158 Benchmark]: RCFGBuilder took 660.80ms. Allocated memory is still 144.7MB. Free memory was 108.1MB in the beginning and 89.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 21:07:20,492 INFO L158 Benchmark]: TraceAbstraction took 20873.93ms. Allocated memory was 144.7MB in the beginning and 369.1MB in the end (delta: 224.4MB). Free memory was 88.7MB in the beginning and 260.1MB in the end (delta: -171.5MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2022-11-02 21:07:20,494 INFO L158 Benchmark]: Witness Printer took 80.13ms. Allocated memory is still 369.1MB. Free memory was 260.1MB in the beginning and 254.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 21:07:20,496 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.24ms. Allocated memory is still 144.7MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.31ms. Allocated memory is still 144.7MB. Free memory was 104.5MB in the beginning and 111.7MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.98ms. Allocated memory is still 144.7MB. Free memory was 111.7MB in the beginning and 109.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.29ms. Allocated memory is still 144.7MB. Free memory was 109.6MB in the beginning and 108.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 660.80ms. Allocated memory is still 144.7MB. Free memory was 108.1MB in the beginning and 89.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20873.93ms. Allocated memory was 144.7MB in the beginning and 369.1MB in the end (delta: 224.4MB). Free memory was 88.7MB in the beginning and 260.1MB in the end (delta: -171.5MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * Witness Printer took 80.13ms. Allocated memory is still 369.1MB. Free memory was 260.1MB in the beginning and 254.9MB in the end (delta: 5.2MB). 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: 616]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-1:0}] [L588] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, new_head={-2:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, new_head={-3:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, new_head={-4:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, new_head={-5:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, new_head={-5:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, len=5] [L602] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() VAL [head={-5:0}, len=5] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 20.7s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4237 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4237 mSDsluCounter, 3644 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 783 IncrementalHoareTripleChecker+Unchecked, 2674 mSDsCounter, 204 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2335 IncrementalHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 204 mSolverCounterUnsat, 970 mSDtfsCounter, 2335 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 699 SyntacticMatches, 11 SemanticMatches, 195 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=9, InterpolantAutomatonStates: 116, 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, 14 MinimizatonAttempts, 352 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1305 ConstructedInterpolants, 61 QuantifiedInterpolants, 6550 SizeOfPredicates, 50 NumberOfNonLiveVariables, 3161 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 1502/1869 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 21:07:20,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f252a597-7e22-4287-875f-ec3616d8e412/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(valid-memcleanup)