./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/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_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:12:04,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:12:04,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:12:04,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:12:04,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:12:04,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:12:04,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:12:04,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:12:04,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:12:04,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:12:04,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:12:04,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:12:04,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:12:04,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:12:04,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:12:04,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:12:04,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:12:04,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:12:04,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:12:04,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:12:04,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:12:04,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:12:04,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:12:04,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:12:04,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:12:04,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:12:04,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:12:04,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:12:04,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:12:04,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:12:04,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:12:04,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:12:04,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:12:04,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:12:04,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:12:04,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:12:04,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:12:04,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:12:04,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:12:04,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:12:04,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:12:04,930 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:12:04,974 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:12:04,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:12:04,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:12:04,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:12:04,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:12:04,976 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:12:04,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:12:04,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:12:04,978 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:12:04,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:12:04,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:12:04,979 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:12:04,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:12:04,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:12:04,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:12:04,980 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:12:04,980 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:12:04,980 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:12:04,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:12:04,981 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:12:04,981 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:12:04,982 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:12:04,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:12:04,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:12:04,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:12:04,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:12:04,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:12:04,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:12:04,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:12:04,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:12:04,984 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_2cd0a623-229d-4393-852d-2fed2ce5e716/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_2cd0a623-229d-4393-852d-2fed2ce5e716/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2022-11-02 20:12:05,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:12:05,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:12:05,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:12:05,442 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:12:05,443 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:12:05,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2022-11-02 20:12:05,535 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/data/b7fa6d473/956c999edffb47288522c530469d6e96/FLAGdd52b79d5 [2022-11-02 20:12:06,168 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:12:06,169 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2022-11-02 20:12:06,183 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/data/b7fa6d473/956c999edffb47288522c530469d6e96/FLAGdd52b79d5 [2022-11-02 20:12:06,476 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/data/b7fa6d473/956c999edffb47288522c530469d6e96 [2022-11-02 20:12:06,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:12:06,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:12:06,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:12:06,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:12:06,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:12:06,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:12:06" (1/1) ... [2022-11-02 20:12:06,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37075dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:06, skipping insertion in model container [2022-11-02 20:12:06,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:12:06" (1/1) ... [2022-11-02 20:12:06,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:12:06,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:12:06,949 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_2cd0a623-229d-4393-852d-2fed2ce5e716/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2022-11-02 20:12:06,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:12:06,973 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:12:07,068 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_2cd0a623-229d-4393-852d-2fed2ce5e716/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2022-11-02 20:12:07,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:12:07,113 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:12:07,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07 WrapperNode [2022-11-02 20:12:07,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:12:07,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:12:07,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:12:07,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:12:07,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,216 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2022-11-02 20:12:07,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:12:07,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:12:07,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:12:07,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:12:07,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,265 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:12:07,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:12:07,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:12:07,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:12:07,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (1/1) ... [2022-11-02 20:12:07,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:12:07,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:07,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:12:07,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:12:07,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:12:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:12:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:12:07,380 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:12:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:12:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:12:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:12:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:12:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:12:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:12:07,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:12:07,524 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:12:07,527 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:12:08,061 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:12:08,070 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:12:08,070 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:12:08,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:12:08 BoogieIcfgContainer [2022-11-02 20:12:08,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:12:08,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:12:08,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:12:08,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:12:08,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:12:06" (1/3) ... [2022-11-02 20:12:08,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b440d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:12:08, skipping insertion in model container [2022-11-02 20:12:08,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:07" (2/3) ... [2022-11-02 20:12:08,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b440d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:12:08, skipping insertion in model container [2022-11-02 20:12:08,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:12:08" (3/3) ... [2022-11-02 20:12:08,088 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2022-11-02 20:12:08,116 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:12:08,116 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-02 20:12:08,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:12:08,205 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;@7b68a996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:12:08,207 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-02 20:12:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:12:08,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:08,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:08,239 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:08,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1813443002, now seen corresponding path program 1 times [2022-11-02 20:12:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:08,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925933291] [2022-11-02 20:12:08,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:08,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:08,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925933291] [2022-11-02 20:12:08,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925933291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:08,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:08,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010019480] [2022-11-02 20:12:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:08,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:08,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:08,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:08,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:08,844 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:08,989 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-02 20:12:08,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:08,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 20:12:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:09,003 INFO L225 Difference]: With dead ends: 79 [2022-11-02 20:12:09,003 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:12:09,005 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 20:12:09,009 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:09,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:12:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:12:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-02 20:12:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.75) internal successors, (77), 72 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-02 20:12:09,060 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 7 [2022-11-02 20:12:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:09,061 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-02 20:12:09,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-02 20:12:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:12:09,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:09,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:09,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:12:09,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:09,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1813443001, now seen corresponding path program 1 times [2022-11-02 20:12:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:09,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293837727] [2022-11-02 20:12:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:09,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:09,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293837727] [2022-11-02 20:12:09,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293837727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:09,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:09,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:09,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397204328] [2022-11-02 20:12:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:09,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:09,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:09,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:09,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:09,143 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:09,226 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-11-02 20:12:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:09,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 20:12:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:09,229 INFO L225 Difference]: With dead ends: 74 [2022-11-02 20:12:09,229 INFO L226 Difference]: Without dead ends: 74 [2022-11-02 20:12:09,229 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 20:12:09,231 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:09,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 118 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:12:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-02 20:12:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-02 20:12:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-02 20:12:09,242 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 7 [2022-11-02 20:12:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:09,243 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-02 20:12:09,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-02 20:12:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:12:09,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:09,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:09,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:12:09,245 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash 712803264, now seen corresponding path program 1 times [2022-11-02 20:12:09,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:09,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826072725] [2022-11-02 20:12:09,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:09,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:09,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:09,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826072725] [2022-11-02 20:12:09,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826072725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:09,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:09,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:12:09,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759717295] [2022-11-02 20:12:09,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:09,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:12:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:12:09,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:12:09,608 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:12:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:09,953 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-11-02 20:12:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:12:09,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-02 20:12:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:09,965 INFO L225 Difference]: With dead ends: 78 [2022-11-02 20:12:09,965 INFO L226 Difference]: Without dead ends: 78 [2022-11-02 20:12:09,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:12:09,968 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 11 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:09,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 281 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:12:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-02 20:12:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-02 20:12:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-02 20:12:09,980 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 13 [2022-11-02 20:12:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:09,981 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-02 20:12:09,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:12:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-02 20:12:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:12:09,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:09,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:09,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:12:09,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:09,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash 712803265, now seen corresponding path program 1 times [2022-11-02 20:12:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:09,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920812950] [2022-11-02 20:12:09,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:10,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:10,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:10,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920812950] [2022-11-02 20:12:10,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920812950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:10,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:10,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:12:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698562816] [2022-11-02 20:12:10,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:10,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:12:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:10,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:12:10,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:12:10,462 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:12:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:10,739 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-02 20:12:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:12:10,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-02 20:12:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:10,744 INFO L225 Difference]: With dead ends: 77 [2022-11-02 20:12:10,744 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 20:12:10,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:12:10,752 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:10,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 297 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:12:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 20:12:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-11-02 20:12:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-02 20:12:10,767 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 13 [2022-11-02 20:12:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:10,767 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-02 20:12:10,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:12:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-02 20:12:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:12:10,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:10,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:10,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:12:10,769 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash 150600896, now seen corresponding path program 1 times [2022-11-02 20:12:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:10,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674201801] [2022-11-02 20:12:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:10,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:12:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:10,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:10,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674201801] [2022-11-02 20:12:10,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674201801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:10,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:10,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:12:10,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638696390] [2022-11-02 20:12:10,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:10,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:12:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:12:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:12:10,869 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:12:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:11,004 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-11-02 20:12:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:12:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-02 20:12:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:11,013 INFO L225 Difference]: With dead ends: 78 [2022-11-02 20:12:11,013 INFO L226 Difference]: Without dead ends: 78 [2022-11-02 20:12:11,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:12:11,014 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:11,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 180 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:12:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-02 20:12:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-02 20:12:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-02 20:12:11,033 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 15 [2022-11-02 20:12:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:11,033 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-02 20:12:11,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:12:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-02 20:12:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:12:11,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:11,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:11,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:12:11,036 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash -513998014, now seen corresponding path program 1 times [2022-11-02 20:12:11,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:11,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449888325] [2022-11-02 20:12:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:11,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:12:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:12:11,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:11,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449888325] [2022-11-02 20:12:11,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449888325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:12:11,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373223933] [2022-11-02 20:12:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:11,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:11,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:11,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:12:11,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:12:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:11,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:12:11,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:12:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:11,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:12:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:12:11,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373223933] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:12:11,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:12:11,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-02 20:12:11,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203772726] [2022-11-02 20:12:11,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:12:11,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:12:11,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:11,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:12:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:12:11,647 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:12:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:11,784 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-02 20:12:11,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:12:11,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-02 20:12:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:11,785 INFO L225 Difference]: With dead ends: 79 [2022-11-02 20:12:11,786 INFO L226 Difference]: Without dead ends: 79 [2022-11-02 20:12:11,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:12:11,787 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 8 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:11,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 250 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:12:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-02 20:12:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-02 20:12:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.58) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:12:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-11-02 20:12:11,794 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 28 [2022-11-02 20:12:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:11,794 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-11-02 20:12:11,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:12:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-11-02 20:12:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:12:11,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:11,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:11,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:12:12,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:12,023 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:12,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:12,023 INFO L85 PathProgramCache]: Analyzing trace with hash -416014336, now seen corresponding path program 2 times [2022-11-02 20:12:12,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:12,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572357963] [2022-11-02 20:12:12,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:12,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:12,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:12,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:12:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:12:12,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:12,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572357963] [2022-11-02 20:12:12,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572357963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:12,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:12,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:12:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900463845] [2022-11-02 20:12:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:12,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:12:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:12,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:12:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:12:12,952 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:13,194 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2022-11-02 20:12:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:12:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-02 20:12:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:13,196 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:12:13,196 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 20:12:13,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:12:13,197 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:13,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 165 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:12:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 20:12:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2022-11-02 20:12:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 70 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:12:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-11-02 20:12:13,204 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 41 [2022-11-02 20:12:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:13,205 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-11-02 20:12:13,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-11-02 20:12:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:12:13,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:13,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:13,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:12:13,207 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:13,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:13,208 INFO L85 PathProgramCache]: Analyzing trace with hash -416014335, now seen corresponding path program 1 times [2022-11-02 20:12:13,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:13,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997676618] [2022-11-02 20:12:13,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:13,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:13,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:14,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:12:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:12:14,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:14,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997676618] [2022-11-02 20:12:14,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997676618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:12:14,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735781224] [2022-11-02 20:12:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:14,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:14,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:14,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:12:14,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:12:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:14,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-02 20:12:14,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:12:14,583 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 20:12:14,636 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 20:12:14,894 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_2| |c_#length|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_2| .cse0 (select |c_#length| .cse0))) (<= 4 (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-02 20:12:14,909 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_2| |c_#length|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_2| .cse0 (select |c_#length| .cse0))) (<= 4 (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-02 20:12:15,069 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 20:12:15,257 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-02 20:12:15,261 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-02 20:12:15,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 5 treesize of output 3 [2022-11-02 20:12:15,557 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (or (<= 4 (select |c_#length| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_sll_prepend_~head#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse0 (select |c_#length| .cse0))) (<= 4 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_sll_prepend_~head#1.base|))))))) is different from false [2022-11-02 20:12:15,560 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (or (<= 4 (select |c_#length| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_sll_prepend_~head#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse0 (select |c_#length| .cse0))) (<= 4 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_sll_prepend_~head#1.base|))))))) is different from true [2022-11-02 20:12:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 1 not checked. [2022-11-02 20:12:15,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:12:15,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735781224] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:12:15,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:12:15,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-11-02 20:12:15,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563096341] [2022-11-02 20:12:15,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:12:15,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:12:15,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:15,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:12:15,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=142, Unknown=6, NotChecked=78, Total=272 [2022-11-02 20:12:15,750 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:12:15,861 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_2| |c_#length|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_2| .cse0 (select |c_#length| .cse0))) (<= 4 (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse1) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse2 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse2 (select |c_#length| .cse2)))))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 20:12:15,866 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_2| |c_#length|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_2| .cse0 (select |c_#length| .cse0))) (<= 4 (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse1) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse2 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse2 (select |c_#length| .cse2)))))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 20:12:15,952 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 4 (select |c_#length| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (<= .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse2 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (<= (+ .cse2 2) |c_ULTIMATE.start_sll_prepend_~head#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse2 (select |c_#length| .cse2))) (<= 4 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_sll_prepend_~head#1.base|)))))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 20:12:15,956 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 4 (select |c_#length| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (<= .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse2 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (<= (+ .cse2 2) |c_ULTIMATE.start_sll_prepend_~head#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse2 (select |c_#length| .cse2))) (<= 4 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_sll_prepend_~head#1.base|)))))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 20:12:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:16,178 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-11-02 20:12:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:12:16,179 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-11-02 20:12:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:16,180 INFO L225 Difference]: With dead ends: 73 [2022-11-02 20:12:16,180 INFO L226 Difference]: Without dead ends: 73 [2022-11-02 20:12:16,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=162, Unknown=10, NotChecked=150, Total=380 [2022-11-02 20:12:16,182 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 60 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:16,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 296 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 294 Invalid, 0 Unknown, 206 Unchecked, 0.4s Time] [2022-11-02 20:12:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-02 20:12:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-02 20:12:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.46) internal successors, (73), 68 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:12:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-11-02 20:12:16,188 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 41 [2022-11-02 20:12:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:16,189 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-11-02 20:12:16,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:12:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-11-02 20:12:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:12:16,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:16,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:16,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:12:16,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:16,422 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:16,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash -11542527, now seen corresponding path program 1 times [2022-11-02 20:12:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:16,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855383734] [2022-11-02 20:12:16,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:16,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:16,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:16,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:12:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:12:16,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:16,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855383734] [2022-11-02 20:12:16,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855383734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:16,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:16,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:12:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287519132] [2022-11-02 20:12:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:16,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:12:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:12:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:12:16,848 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:12:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:17,034 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-11-02 20:12:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:12:17,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-11-02 20:12:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:17,036 INFO L225 Difference]: With dead ends: 72 [2022-11-02 20:12:17,036 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:12:17,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:12:17,037 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 50 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:17,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 204 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:12:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:12:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-02 20:12:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.44) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:12:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-11-02 20:12:17,043 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 42 [2022-11-02 20:12:17,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:17,044 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-11-02 20:12:17,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:12:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-11-02 20:12:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:12:17,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:17,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:17,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:12:17,046 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:17,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash -11542528, now seen corresponding path program 1 times [2022-11-02 20:12:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:17,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230642044] [2022-11-02 20:12:17,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:17,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:17,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:17,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:12:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:12:17,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:17,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230642044] [2022-11-02 20:12:17,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230642044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:17,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:17,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:12:17,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033297986] [2022-11-02 20:12:17,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:17,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:12:17,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:17,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:12:17,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:12:17,243 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:12:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:17,405 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-11-02 20:12:17,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:12:17,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-11-02 20:12:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:17,407 INFO L225 Difference]: With dead ends: 83 [2022-11-02 20:12:17,407 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 20:12:17,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:12:17,408 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:17,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 205 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:12:17,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 20:12:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2022-11-02 20:12:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.42) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:12:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-02 20:12:17,414 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 42 [2022-11-02 20:12:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:17,415 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-02 20:12:17,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:12:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-02 20:12:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:12:17,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:17,417 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:17,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:12:17,417 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash 341921059, now seen corresponding path program 1 times [2022-11-02 20:12:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:17,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773696423] [2022-11-02 20:12:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:17,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:17,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:17,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:12:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:12:17,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:17,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773696423] [2022-11-02 20:12:17,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773696423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:17,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:17,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:12:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207318707] [2022-11-02 20:12:17,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:17,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:12:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:17,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:12:17,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:12:17,763 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:17,889 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-11-02 20:12:17,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:12:17,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-11-02 20:12:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:17,892 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:12:17,893 INFO L226 Difference]: Without dead ends: 69 [2022-11-02 20:12:17,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:12:17,894 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 135 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:17,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 115 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:12:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-02 20:12:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-02 20:12:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:12:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-02 20:12:17,911 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 46 [2022-11-02 20:12:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:17,911 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-02 20:12:17,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-02 20:12:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:12:17,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:17,918 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:17,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:12:17,918 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2126344669, now seen corresponding path program 1 times [2022-11-02 20:12:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:17,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641817745] [2022-11-02 20:12:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:18,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:18,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:18,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:12:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:12:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:18,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641817745] [2022-11-02 20:12:18,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641817745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:18,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:18,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:12:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067600373] [2022-11-02 20:12:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:18,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:12:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:18,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:12:18,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:12:18,437 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:18,729 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-11-02 20:12:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:12:18,730 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-02 20:12:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:18,731 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:12:18,731 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:12:18,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:12:18,732 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 138 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:18,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 250 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:12:18,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:12:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-11-02 20:12:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.32) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:12:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-11-02 20:12:18,736 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 48 [2022-11-02 20:12:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:18,737 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-11-02 20:12:18,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-11-02 20:12:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:12:18,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:18,739 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:18,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:12:18,739 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2126344668, now seen corresponding path program 1 times [2022-11-02 20:12:18,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:18,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371631462] [2022-11-02 20:12:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:18,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:19,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:19,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:12:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:12:19,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:19,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371631462] [2022-11-02 20:12:19,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371631462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:19,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:19,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:12:19,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227861387] [2022-11-02 20:12:19,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:19,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:12:19,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:19,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:12:19,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:12:19,408 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:19,687 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-11-02 20:12:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:12:19,688 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-02 20:12:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:19,689 INFO L225 Difference]: With dead ends: 66 [2022-11-02 20:12:19,689 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 20:12:19,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:12:19,690 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 116 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:19,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 253 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:12:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 20:12:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-11-02 20:12:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.28) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:12:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-02 20:12:19,694 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 48 [2022-11-02 20:12:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:19,694 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-02 20:12:19,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-02 20:12:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:12:19,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:19,696 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:19,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:12:19,696 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash 987206626, now seen corresponding path program 1 times [2022-11-02 20:12:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:19,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402621166] [2022-11-02 20:12:19,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:20,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:20,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:20,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:12:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:12:20,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:20,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402621166] [2022-11-02 20:12:20,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402621166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:20,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:20,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:12:20,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104494341] [2022-11-02 20:12:20,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:20,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:12:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:12:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:12:20,709 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:21,253 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-11-02 20:12:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:12:21,254 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-11-02 20:12:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:21,254 INFO L225 Difference]: With dead ends: 64 [2022-11-02 20:12:21,255 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 20:12:21,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:12:21,256 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 105 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:21,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 312 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:12:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 20:12:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-02 20:12:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:12:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-11-02 20:12:21,259 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 50 [2022-11-02 20:12:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:21,260 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-11-02 20:12:21,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-11-02 20:12:21,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:12:21,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:21,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:21,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:12:21,262 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:21,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:21,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2063364139, now seen corresponding path program 1 times [2022-11-02 20:12:21,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:21,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338842535] [2022-11-02 20:12:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:22,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:12:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:12:23,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:23,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338842535] [2022-11-02 20:12:23,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338842535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:12:23,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749445139] [2022-11-02 20:12:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:23,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:23,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:23,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:12:23,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:12:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:23,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 20:12:23,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:12:24,082 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 9 treesize of output 5 [2022-11-02 20:12:24,346 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1274 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1272 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1272)))) is different from true [2022-11-02 20:12:24,366 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1274 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1274) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1272 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1272)))) is different from true [2022-11-02 20:12:24,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:12:24,404 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 20:12:24,426 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:12:24,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-02 20:12:24,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:12:24,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-11-02 20:12:24,890 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:12:24,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:12:24,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2022-11-02 20:12:25,014 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 27 treesize of output 19 [2022-11-02 20:12:25,262 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-02 20:12:25,263 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2022-11-02 20:12:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:12:25,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:12:25,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749445139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:25,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:12:25,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [23] total 40 [2022-11-02 20:12:25,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718163671] [2022-11-02 20:12:25,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:25,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 20:12:25,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:25,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:12:25,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1354, Unknown=28, NotChecked=150, Total=1640 [2022-11-02 20:12:25,306 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:26,113 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-02 20:12:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:12:26,114 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-11-02 20:12:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:26,115 INFO L225 Difference]: With dead ends: 84 [2022-11-02 20:12:26,115 INFO L226 Difference]: Without dead ends: 84 [2022-11-02 20:12:26,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=156, Invalid=1798, Unknown=34, NotChecked=174, Total=2162 [2022-11-02 20:12:26,117 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:26,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 329 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 0 Unknown, 320 Unchecked, 0.3s Time] [2022-11-02 20:12:26,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-02 20:12:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2022-11-02 20:12:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 61 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:12:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-11-02 20:12:26,121 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 53 [2022-11-02 20:12:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:26,121 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-11-02 20:12:26,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:12:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-11-02 20:12:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:12:26,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:26,130 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:26,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:12:26,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:12:26,342 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:12:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:26,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2063364138, now seen corresponding path program 1 times [2022-11-02 20:12:26,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:26,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586225192] [2022-11-02 20:12:26,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:26,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:28,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:12:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:28,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:28,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:12:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:12:28,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:28,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586225192] [2022-11-02 20:12:28,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586225192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:12:28,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562565974] [2022-11-02 20:12:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:28,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:28,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:28,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:12:28,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:12:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:29,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-02 20:12:29,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:12:29,289 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 20:12:30,028 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 19 treesize of output 11 [2022-11-02 20:12:30,037 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 7 treesize of output 3 [2022-11-02 20:12:30,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:12:30,520 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 11 [2022-11-02 20:12:30,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:12:30,542 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 27 treesize of output 20 [2022-11-02 20:12:30,562 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:12:30,563 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 15 treesize of output 15 [2022-11-02 20:12:30,575 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 18 treesize of output 13 [2022-11-02 20:12:30,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:12:30,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-02 20:12:30,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:12:30,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-11-02 20:12:31,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:12:31,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-02 20:12:31,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:12:31,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 33 [2022-11-02 20:12:31,608 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 20:12:31,609 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 47 [2022-11-02 20:12:31,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:12:31,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-11-02 20:12:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:12:31,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:12:34,435 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))) (and (forall ((|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int)) (<= 0 (+ 4 (let ((.cse3 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse5 .cse3 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse2 .cse3 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) (forall ((|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int)) (let ((.cse11 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse6 (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse5 .cse11 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|)))) (store .cse12 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse2 .cse11 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (+ 8 (select (select .cse6 .cse7) .cse8)) (select |c_#length| (select (select .cse9 .cse7) .cse8))))))))) is different from false [2022-11-02 20:13:12,790 WARN L234 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:13:57,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562565974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:13:57,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:13:57,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2022-11-02 20:13:57,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837106513] [2022-11-02 20:13:57,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:13:57,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 20:13:57,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:13:57,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 20:13:57,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2587, Unknown=21, NotChecked=102, Total=2862 [2022-11-02 20:13:57,215 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 44 states, 41 states have (on average 2.024390243902439) internal successors, (83), 38 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:14:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:00,804 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-11-02 20:14:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:14:00,805 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.024390243902439) internal successors, (83), 38 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2022-11-02 20:14:00,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:00,806 INFO L225 Difference]: With dead ends: 88 [2022-11-02 20:14:00,806 INFO L226 Difference]: Without dead ends: 88 [2022-11-02 20:14:00,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 90.0s TimeCoverageRelationStatistics Valid=306, Invalid=4369, Unknown=21, NotChecked=134, Total=4830 [2022-11-02 20:14:00,808 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 89 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:00,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 785 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 957 Invalid, 0 Unknown, 68 Unchecked, 1.1s Time] [2022-11-02 20:14:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-02 20:14:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2022-11-02 20:14:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:14:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-11-02 20:14:00,812 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 53 [2022-11-02 20:14:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:00,812 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-11-02 20:14:00,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.024390243902439) internal successors, (83), 38 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:14:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-11-02 20:14:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:14:00,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:00,814 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:00,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:14:01,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:14:01,014 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:14:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash 460219817, now seen corresponding path program 1 times [2022-11-02 20:14:01,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:01,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285608771] [2022-11-02 20:14:01,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:01,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:01,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:14:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:01,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:02,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:14:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:14:02,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:02,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285608771] [2022-11-02 20:14:02,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285608771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:02,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351815978] [2022-11-02 20:14:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:02,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:02,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:02,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:14:02,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:14:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:02,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-02 20:14:02,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:14:02,965 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 8 treesize of output 4 [2022-11-02 20:14:03,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:03,318 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 15 treesize of output 17 [2022-11-02 20:14:03,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:03,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-02 20:14:03,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:03,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2022-11-02 20:14:03,761 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:14:03,897 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 20:14:04,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:14:04,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:04,282 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:14:04,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 19 [2022-11-02 20:14:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:14:04,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:14:04,706 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 28 treesize of output 24 [2022-11-02 20:14:16,500 WARN L234 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:14:16,809 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| Int) (|v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_10| Int) (v_ArrVal_1673 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_19| Int)) (or (not (= (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| (store v_ArrVal_1673 (+ |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_10| 4) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| v_ArrVal_1673) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17|))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_19| 4)) 0)) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| |c_#StackHeapBarrier|)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_19|)) (< 0 |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_10|))))) (and (or (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0) (or .cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| Int) (|v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_10| Int) (v_ArrVal_1673 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_19| Int)) (or (< |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_10| |v_ULTIMATE.start_main_~ptr~0#1.offset_19|) (not (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| (store v_ArrVal_1673 (+ |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_10| 4) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| v_ArrVal_1673) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17|))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_19| 4)) 0)) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| |c_#StackHeapBarrier|)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_19|)) (< 0 |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_10|))))) is different from false [2022-11-02 20:14:16,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351815978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:16,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:14:16,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2022-11-02 20:14:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778022528] [2022-11-02 20:14:16,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:14:16,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 20:14:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:16,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 20:14:16,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2201, Unknown=6, NotChecked=94, Total=2450 [2022-11-02 20:14:16,817 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:14:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:18,282 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-02 20:14:18,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:14:18,283 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-02 20:14:18,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:18,284 INFO L225 Difference]: With dead ends: 71 [2022-11-02 20:14:18,284 INFO L226 Difference]: Without dead ends: 71 [2022-11-02 20:14:18,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=265, Invalid=3515, Unknown=6, NotChecked=120, Total=3906 [2022-11-02 20:14:18,286 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:18,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 934 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 574 Invalid, 0 Unknown, 128 Unchecked, 0.5s Time] [2022-11-02 20:14:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-02 20:14:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-11-02 20:14:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 63 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:14:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-11-02 20:14:18,290 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 54 [2022-11-02 20:14:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:18,291 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-11-02 20:14:18,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:14:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-11-02 20:14:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 20:14:18,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:18,293 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:18,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:14:18,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:18,510 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:14:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash 913244988, now seen corresponding path program 1 times [2022-11-02 20:14:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:18,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913635414] [2022-11-02 20:14:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:20,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:14:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:20,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:14:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:14:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913635414] [2022-11-02 20:14:21,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913635414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962789896] [2022-11-02 20:14:21,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:21,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:21,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:21,372 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:14:21,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:14:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:21,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-02 20:14:21,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:14:21,725 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 20:14:21,781 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:14:22,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:22,030 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 21 treesize of output 20 [2022-11-02 20:14:22,428 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 30 treesize of output 18 [2022-11-02 20:14:22,433 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 7 treesize of output 3 [2022-11-02 20:14:22,444 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 7 treesize of output 3 [2022-11-02 20:14:22,448 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 20:14:22,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:22,992 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 14 treesize of output 16 [2022-11-02 20:14:23,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:23,008 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 36 treesize of output 34 [2022-11-02 20:14:23,024 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:14:23,024 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 15 treesize of output 15 [2022-11-02 20:14:23,035 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 18 treesize of output 20 [2022-11-02 20:14:23,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:23,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-02 20:14:23,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:23,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2022-11-02 20:14:23,458 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 18 treesize of output 20 [2022-11-02 20:14:23,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:23,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2022-11-02 20:14:23,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:23,679 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 24 treesize of output 26 [2022-11-02 20:14:23,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:23,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-02 20:14:24,258 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 20:14:24,258 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 54 [2022-11-02 20:14:24,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:24,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-11-02 20:14:24,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:14:24,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:14:24,492 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 15 treesize of output 10 [2022-11-02 20:14:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:14:24,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:14:25,887 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1864 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_20| Int) (v_ArrVal_1872 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1867 Int)) (let ((.cse5 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 v_ArrVal_1867)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| v_ArrVal_1864) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1872) (select (select .cse0 .cse1) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_20|)) (< (select (select .cse3 .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_20|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_20|)) (not (<= v_ArrVal_1867 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|))))))) is different from false [2022-11-02 20:14:25,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1864 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_20| Int) (v_ArrVal_1872 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1867 Int)) (let ((.cse5 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 v_ArrVal_1867)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (< (select (select .cse0 .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_20|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) v_ArrVal_1867) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_20|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| v_ArrVal_1864) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1872) (select (select .cse3 .cse1) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_20|))))))) is different from false [2022-11-02 20:14:25,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1864 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_20| Int) (v_ArrVal_1872 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1867 Int)) (let ((.cse5 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5 v_ArrVal_1867)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< (select (select .cse0 .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_20|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) v_ArrVal_1867) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_20|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_1864) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1872) (select (select .cse3 .cse1) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_20|))))))) is different from false [2022-11-02 20:14:26,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962789896] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:26,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:14:26,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 46 [2022-11-02 20:14:26,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307878854] [2022-11-02 20:14:26,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:14:26,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:14:26,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:26,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:14:26,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2628, Unknown=5, NotChecked=312, Total=3080 [2022-11-02 20:14:26,646 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 46 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 40 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:14:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:30,434 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-11-02 20:14:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:14:30,438 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 40 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-11-02 20:14:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:30,439 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:14:30,439 INFO L226 Difference]: Without dead ends: 69 [2022-11-02 20:14:30,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=295, Invalid=4968, Unknown=5, NotChecked=432, Total=5700 [2022-11-02 20:14:30,442 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:30,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1022 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1024 Invalid, 0 Unknown, 115 Unchecked, 1.0s Time] [2022-11-02 20:14:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-02 20:14:30,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-02 20:14:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:14:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-11-02 20:14:30,445 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 57 [2022-11-02 20:14:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:30,446 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-11-02 20:14:30,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 40 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:14:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-11-02 20:14:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:14:30,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:30,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:30,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:14:30,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:14:30,662 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:14:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1754175976, now seen corresponding path program 1 times [2022-11-02 20:14:30,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:30,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289972181] [2022-11-02 20:14:30,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:32,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:14:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:33,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:14:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:14:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:14:34,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:34,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289972181] [2022-11-02 20:14:34,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289972181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:34,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528066390] [2022-11-02 20:14:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:34,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:34,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:34,157 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:14:34,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:14:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:34,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-02 20:14:34,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:14:34,859 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-02 20:14:34,859 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 19 treesize of output 16 [2022-11-02 20:14:35,084 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 20:14:35,643 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:14:35,644 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2022-11-02 20:14:35,647 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 7 treesize of output 3 [2022-11-02 20:14:35,653 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:14:36,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:36,279 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:14:36,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 50 [2022-11-02 20:14:36,328 INFO L356 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-02 20:14:36,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2022-11-02 20:14:36,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:36,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:14:36,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:36,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:36,933 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:14:36,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 54 [2022-11-02 20:14:36,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:36,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-02 20:14:37,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:37,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-02 20:14:37,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:37,238 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-02 20:14:37,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 61 [2022-11-02 20:14:37,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:37,953 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 142 [2022-11-02 20:14:38,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:14:38,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:14:38,362 INFO L356 Elim1Store]: treesize reduction 39, result has 7.1 percent of original size [2022-11-02 20:14:38,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 50 [2022-11-02 20:14:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:38,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:15:13,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int)) (let ((.cse6 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (or (= 1 (select |c_#valid| (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ .cse3 4)))) (not (<= 0 .cse3)))))))) is different from false [2022-11-02 20:15:58,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528066390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:15:58,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:15:58,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30] total 62 [2022-11-02 20:15:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369188136] [2022-11-02 20:15:58,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:15:58,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-02 20:15:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:58,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-02 20:15:58,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=5131, Unknown=35, NotChecked=144, Total=5550 [2022-11-02 20:15:58,956 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 63 states, 60 states have (on average 1.7) internal successors, (102), 55 states have internal predecessors, (102), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:16:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:03,728 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-11-02 20:16:03,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 20:16:03,728 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 60 states have (on average 1.7) internal successors, (102), 55 states have internal predecessors, (102), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2022-11-02 20:16:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:03,729 INFO L225 Difference]: With dead ends: 72 [2022-11-02 20:16:03,730 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:16:03,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 87.9s TimeCoverageRelationStatistics Valid=444, Invalid=8081, Unknown=35, NotChecked=182, Total=8742 [2022-11-02 20:16:03,732 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 53 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:03,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1141 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1209 Invalid, 0 Unknown, 259 Unchecked, 1.4s Time] [2022-11-02 20:16:03,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:16:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-11-02 20:16:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.263157894736842) internal successors, (72), 66 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:16:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-02 20:16:03,735 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 58 [2022-11-02 20:16:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:03,736 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-02 20:16:03,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 60 states have (on average 1.7) internal successors, (102), 55 states have internal predecessors, (102), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:16:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-02 20:16:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:16:03,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:03,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:03,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:16:03,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:03,946 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-02 20:16:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1754175975, now seen corresponding path program 1 times [2022-11-02 20:16:03,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:03,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323621974] [2022-11-02 20:16:03,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:06,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:16:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:07,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:16:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:07,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:16:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:16:08,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:08,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323621974] [2022-11-02 20:16:08,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323621974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:08,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002705521] [2022-11-02 20:16:08,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:08,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:08,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:08,092 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:08,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd0a623-229d-4393-852d-2fed2ce5e716/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:16:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:08,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-02 20:16:08,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:09,374 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:16:09,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:16:09,424 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:16:09,424 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 20:16:09,726 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 20:16:09,741 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9