./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- 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-dbf71c6-m [2022-10-17 11:00:03,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 11:00:03,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 11:00:04,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 11:00:04,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 11:00:04,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 11:00:04,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 11:00:04,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 11:00:04,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 11:00:04,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 11:00:04,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 11:00:04,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 11:00:04,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 11:00:04,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 11:00:04,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 11:00:04,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 11:00:04,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 11:00:04,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 11:00:04,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 11:00:04,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 11:00:04,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 11:00:04,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 11:00:04,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 11:00:04,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 11:00:04,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 11:00:04,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 11:00:04,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 11:00:04,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 11:00:04,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 11:00:04,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 11:00:04,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 11:00:04,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 11:00:04,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 11:00:04,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 11:00:04,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 11:00:04,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 11:00:04,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 11:00:04,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 11:00:04,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 11:00:04,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 11:00:04,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 11:00:04,125 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 11:00:04,166 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 11:00:04,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 11:00:04,167 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 11:00:04,167 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 11:00:04,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 11:00:04,169 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 11:00:04,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 11:00:04,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 11:00:04,170 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 11:00:04,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 11:00:04,172 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 11:00:04,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 11:00:04,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 11:00:04,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 11:00:04,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 11:00:04,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 11:00:04,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 11:00:04,173 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 11:00:04,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 11:00:04,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 11:00:04,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 11:00:04,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 11:00:04,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 11:00:04,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 11:00:04,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 11:00:04,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 11:00:04,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 11:00:04,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 11:00:04,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 11:00:04,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 11:00:04,176 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 11:00:04,177 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 11:00:04,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 11:00:04,177 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_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/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_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2022-10-17 11:00:04,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 11:00:04,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 11:00:04,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 11:00:04,473 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 11:00:04,474 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 11:00:04,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-10-17 11:00:04,551 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/data/645d86cd7/7e257cd28376455f83c90eb45ef4455d/FLAG1d5f194a6 [2022-10-17 11:00:05,086 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 11:00:05,087 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-10-17 11:00:05,103 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/data/645d86cd7/7e257cd28376455f83c90eb45ef4455d/FLAG1d5f194a6 [2022-10-17 11:00:05,401 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/data/645d86cd7/7e257cd28376455f83c90eb45ef4455d [2022-10-17 11:00:05,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 11:00:05,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 11:00:05,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 11:00:05,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 11:00:05,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 11:00:05,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:05,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e0d0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05, skipping insertion in model container [2022-10-17 11:00:05,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:05,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 11:00:05,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 11:00:05,846 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_46107912-3a6f-44e9-a7d3-2372da9973ff/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-10-17 11:00:05,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 11:00:05,865 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 11:00:05,927 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_46107912-3a6f-44e9-a7d3-2372da9973ff/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-10-17 11:00:05,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 11:00:05,972 INFO L208 MainTranslator]: Completed translation [2022-10-17 11:00:05,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05 WrapperNode [2022-10-17 11:00:05,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 11:00:05,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 11:00:05,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 11:00:05,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 11:00:05,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,049 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2022-10-17 11:00:06,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 11:00:06,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 11:00:06,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 11:00:06,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 11:00:06,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,133 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 11:00:06,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 11:00:06,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 11:00:06,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 11:00:06,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (1/1) ... [2022-10-17 11:00:06,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 11:00:06,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 11:00:06,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 11:00:06,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 11:00:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-17 11:00:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 11:00:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-10-17 11:00:06,274 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-10-17 11:00:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-17 11:00:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 11:00:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 11:00:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-17 11:00:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-17 11:00:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 11:00:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-17 11:00:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 11:00:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 11:00:06,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 11:00:06,476 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 11:00:06,478 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 11:00:06,724 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 11:00:06,731 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 11:00:06,732 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-17 11:00:06,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:00:06 BoogieIcfgContainer [2022-10-17 11:00:06,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 11:00:06,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 11:00:06,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 11:00:06,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 11:00:06,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 11:00:05" (1/3) ... [2022-10-17 11:00:06,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ed7e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:00:06, skipping insertion in model container [2022-10-17 11:00:06,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:00:05" (2/3) ... [2022-10-17 11:00:06,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ed7e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:00:06, skipping insertion in model container [2022-10-17 11:00:06,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:00:06" (3/3) ... [2022-10-17 11:00:06,744 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2022-10-17 11:00:06,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 11:00:06,764 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-17 11:00:06,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 11:00:06,825 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ee662bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 11:00:06,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-17 11:00:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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-10-17 11:00:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-17 11:00:06,840 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 11:00:06,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 11:00:06,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 11:00:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:00:06,847 INFO L85 PathProgramCache]: Analyzing trace with hash 845524335, now seen corresponding path program 1 times [2022-10-17 11:00:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:00:06,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953199702] [2022-10-17 11:00:06,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:00:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:07,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-17 11:00:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 11:00:07,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:00:07,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953199702] [2022-10-17 11:00:07,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953199702] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 11:00:07,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 11:00:07,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 11:00:07,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524382899] [2022-10-17 11:00:07,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 11:00:07,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 11:00:07,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:00:07,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 11:00:07,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 11:00:07,162 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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-10-17 11:00:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 11:00:07,249 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-10-17 11:00:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 11:00:07,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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 16 [2022-10-17 11:00:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 11:00:07,260 INFO L225 Difference]: With dead ends: 48 [2022-10-17 11:00:07,260 INFO L226 Difference]: Without dead ends: 21 [2022-10-17 11:00:07,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-17 11:00:07,270 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 11:00:07,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 11:00:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-10-17 11:00:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-10-17 11:00:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-10-17 11:00:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-10-17 11:00:07,323 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2022-10-17 11:00:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 11:00:07,324 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-10-17 11:00:07,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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-10-17 11:00:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-10-17 11:00:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-17 11:00:07,328 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 11:00:07,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 11:00:07,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 11:00:07,329 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 11:00:07,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:00:07,331 INFO L85 PathProgramCache]: Analyzing trace with hash 595026039, now seen corresponding path program 1 times [2022-10-17 11:00:07,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:00:07,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282353075] [2022-10-17 11:00:07,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:07,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:00:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-17 11:00:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 11:00:07,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:00:07,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282353075] [2022-10-17 11:00:07,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282353075] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 11:00:07,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 11:00:07,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 11:00:07,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277168932] [2022-10-17 11:00:07,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 11:00:07,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 11:00:07,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:00:07,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 11:00:07,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 11:00:07,696 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-10-17 11:00:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 11:00:07,764 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-10-17 11:00:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 11:00:07,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-10-17 11:00:07,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 11:00:07,767 INFO L225 Difference]: With dead ends: 40 [2022-10-17 11:00:07,768 INFO L226 Difference]: Without dead ends: 25 [2022-10-17 11:00:07,769 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-10-17 11:00:07,772 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 11:00:07,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 11:00:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-10-17 11:00:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-10-17 11:00:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-10-17 11:00:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-10-17 11:00:07,787 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2022-10-17 11:00:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 11:00:07,789 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-10-17 11:00:07,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-10-17 11:00:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-10-17 11:00:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-17 11:00:07,796 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 11:00:07,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 11:00:07,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 11:00:07,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 11:00:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:00:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash -190501289, now seen corresponding path program 1 times [2022-10-17 11:00:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:00:07,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069393765] [2022-10-17 11:00:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:00:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 11:00:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:08,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-17 11:00:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-17 11:00:08,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:00:08,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069393765] [2022-10-17 11:00:08,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069393765] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 11:00:08,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334408337] [2022-10-17 11:00:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:08,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 11:00:08,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 11:00:08,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 11:00:08,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-17 11:00:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:08,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-17 11:00:08,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 11:00:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 11:00:08,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 11:00:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-17 11:00:08,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334408337] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 11:00:08,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 11:00:08,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-10-17 11:00:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917470159] [2022-10-17 11:00:08,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 11:00:08,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 11:00:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:00:08,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 11:00:08,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-17 11:00:08,437 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-10-17 11:00:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 11:00:08,505 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-10-17 11:00:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 11:00:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 25 [2022-10-17 11:00:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 11:00:08,509 INFO L225 Difference]: With dead ends: 41 [2022-10-17 11:00:08,510 INFO L226 Difference]: Without dead ends: 26 [2022-10-17 11:00:08,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 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-10-17 11:00:08,515 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 11:00:08,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 11:00:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-17 11:00:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-17 11:00:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-10-17 11:00:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-10-17 11:00:08,555 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 25 [2022-10-17 11:00:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 11:00:08,555 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-10-17 11:00:08,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-10-17 11:00:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-10-17 11:00:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-17 11:00:08,559 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 11:00:08,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 11:00:08,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-17 11:00:08,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-17 11:00:08,773 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 11:00:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:00:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1242497929, now seen corresponding path program 2 times [2022-10-17 11:00:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:00:08,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930535611] [2022-10-17 11:00:08,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:08,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:00:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:09,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 11:00:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:09,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-17 11:00:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 11:00:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-17 11:00:10,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:00:10,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930535611] [2022-10-17 11:00:10,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930535611] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 11:00:10,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 11:00:10,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-17 11:00:10,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658645515] [2022-10-17 11:00:10,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 11:00:10,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 11:00:10,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:00:10,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 11:00:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-17 11:00:10,104 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-10-17 11:00:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 11:00:10,367 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-10-17 11:00:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 11:00:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 34 [2022-10-17 11:00:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 11:00:10,371 INFO L225 Difference]: With dead ends: 33 [2022-10-17 11:00:10,371 INFO L226 Difference]: Without dead ends: 31 [2022-10-17 11:00:10,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-10-17 11:00:10,379 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 11:00:10,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 70 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 11:00:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-10-17 11:00:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-10-17 11:00:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-10-17 11:00:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-10-17 11:00:10,397 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 34 [2022-10-17 11:00:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 11:00:10,398 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-10-17 11:00:10,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-10-17 11:00:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-10-17 11:00:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-17 11:00:10,401 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 11:00:10,401 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 11:00:10,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 11:00:10,403 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 11:00:10,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:00:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1242499603, now seen corresponding path program 1 times [2022-10-17 11:00:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:00:10,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967245048] [2022-10-17 11:00:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:00:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:10,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 11:00:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:10,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-17 11:00:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:10,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 11:00:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-17 11:00:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:00:10,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967245048] [2022-10-17 11:00:10,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967245048] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 11:00:10,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 11:00:10,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-17 11:00:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105042671] [2022-10-17 11:00:10,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 11:00:10,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 11:00:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:00:10,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 11:00:10,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-10-17 11:00:10,853 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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-10-17 11:00:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 11:00:10,982 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-10-17 11:00:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 11:00:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 34 [2022-10-17 11:00:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 11:00:10,986 INFO L225 Difference]: With dead ends: 31 [2022-10-17 11:00:10,986 INFO L226 Difference]: Without dead ends: 28 [2022-10-17 11:00:10,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-10-17 11:00:10,988 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 11:00:10,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 11:00:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-10-17 11:00:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-10-17 11:00:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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-10-17 11:00:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-10-17 11:00:11,003 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2022-10-17 11:00:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 11:00:11,004 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-10-17 11:00:11,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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-10-17 11:00:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-10-17 11:00:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-17 11:00:11,008 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 11:00:11,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 11:00:11,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 11:00:11,009 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 11:00:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:00:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash -39567630, now seen corresponding path program 1 times [2022-10-17 11:00:11,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:00:11,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945027221] [2022-10-17 11:00:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:11,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:00:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:13,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 11:00:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:13,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-17 11:00:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:13,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 11:00:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-17 11:00:14,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:00:14,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945027221] [2022-10-17 11:00:14,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945027221] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 11:00:14,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127828255] [2022-10-17 11:00:14,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:14,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 11:00:14,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 11:00:14,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 11:00:14,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-17 11:00:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:14,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 129 conjunts are in the unsatisfiable core [2022-10-17 11:00:14,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 11:00:14,435 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-10-17 11:00:14,514 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-10-17 11:00:14,660 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-17 11:00:14,661 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 12 treesize of output 14 [2022-10-17 11:00:14,838 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-10-17 11:00:14,923 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-10-17 11:00:15,020 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-17 11:00:15,020 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-10-17 11:00:15,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:15,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-17 11:00:15,548 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 29 treesize of output 17 [2022-10-17 11:00:15,560 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-10-17 11:00:15,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-17 11:00:15,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:15,920 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-10-17 11:00:15,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:15,942 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 35 treesize of output 33 [2022-10-17 11:00:15,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:15,958 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-10-17 11:00:15,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-10-17 11:00:15,980 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 18 treesize of output 20 [2022-10-17 11:00:16,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:16,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:16,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 33 treesize of output 32 [2022-10-17 11:00:16,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:16,135 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 67 treesize of output 32 [2022-10-17 11:00:16,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:16,155 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 31 treesize of output 35 [2022-10-17 11:00:16,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:16,167 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 37 treesize of output 33 [2022-10-17 11:00:16,175 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 0 case distinctions, treesize of input 30 treesize of output 25 [2022-10-17 11:00:16,187 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 18 treesize of output 17 [2022-10-17 11:00:16,447 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-10-17 11:00:16,447 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 122 treesize of output 53 [2022-10-17 11:00:16,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:16,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-10-17 11:00:16,624 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-10-17 11:00:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 11:00:16,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 11:00:16,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_5| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (+ |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_5| 4))) (let ((.cse3 (store (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 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_592) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_5|))) (.cse0 (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 .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_588) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_589) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-10-17 11:00:17,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_11| Int) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_5| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_11|) 0)) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_11| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (+ |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_5| 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_11| (store v_ArrVal_609 .cse5 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_11| v_ArrVal_609) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_11| v_ArrVal_592) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_5|))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_11| (store v_ArrVal_608 .cse5 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_11| v_ArrVal_608) |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_11|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_11| v_ArrVal_588) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_589) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))))) is different from false [2022-10-17 11:00:17,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127828255] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 11:00:17,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-17 11:00:17,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2022-10-17 11:00:17,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806185726] [2022-10-17 11:00:17,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-17 11:00:17,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-17 11:00:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:00:17,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-17 11:00:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1778, Unknown=3, NotChecked=170, Total=2070 [2022-10-17 11:00:17,095 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 32 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-17 11:00:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 11:00:18,603 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-10-17 11:00:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-17 11:00:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 32 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2022-10-17 11:00:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 11:00:18,605 INFO L225 Difference]: With dead ends: 35 [2022-10-17 11:00:18,605 INFO L226 Difference]: Without dead ends: 33 [2022-10-17 11:00:18,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=207, Invalid=2768, Unknown=3, NotChecked=214, Total=3192 [2022-10-17 11:00:18,608 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-17 11:00:18,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 230 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 472 Invalid, 0 Unknown, 41 Unchecked, 0.5s Time] [2022-10-17 11:00:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-17 11:00:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-10-17 11:00:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-10-17 11:00:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-10-17 11:00:18,617 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 36 [2022-10-17 11:00:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 11:00:18,618 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-10-17 11:00:18,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 32 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-17 11:00:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-10-17 11:00:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-17 11:00:18,619 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 11:00:18,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 11:00:18,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-17 11:00:18,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 11:00:18,832 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 11:00:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:00:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -39569304, now seen corresponding path program 1 times [2022-10-17 11:00:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:00:18,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009683676] [2022-10-17 11:00:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:00:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 11:00:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:19,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-17 11:00:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 11:00:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-17 11:00:19,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:00:19,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009683676] [2022-10-17 11:00:19,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009683676] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 11:00:19,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13500697] [2022-10-17 11:00:19,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 11:00:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 11:00:19,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 11:00:19,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-17 11:00:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:19,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-17 11:00:19,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 11:00:20,254 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 17 treesize of output 9 [2022-10-17 11:00:20,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:20,418 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 24 treesize of output 24 [2022-10-17 11:00:20,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:20,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:20,506 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 14 [2022-10-17 11:00:20,510 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 8 treesize of output 7 [2022-10-17 11:00:20,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:20,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:20,523 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 0 case distinctions, treesize of input 41 treesize of output 38 [2022-10-17 11:00:20,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:20,530 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 41 treesize of output 35 [2022-10-17 11:00:20,537 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 0 case distinctions, treesize of input 32 treesize of output 25 [2022-10-17 11:00:20,545 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 12 treesize of output 11 [2022-10-17 11:00:20,610 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-10-17 11:00:21,777 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-10-17 11:00:21,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 61 [2022-10-17 11:00:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 11:00:21,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 11:00:21,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 11:00:21,947 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 464 treesize of output 467 [2022-10-17 11:00:21,956 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 600 treesize of output 596 [2022-10-17 11:00:21,964 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 596 treesize of output 594 [2022-10-17 11:00:22,030 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 140 treesize of output 138 [2022-10-17 11:00:22,046 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 66 treesize of output 64 [2022-10-17 11:00:22,088 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 66 treesize of output 64 [2022-10-17 11:00:24,576 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_791 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_782 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| Int)) (or (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| (store v_ArrVal_791 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| v_ArrVal_791) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| v_ArrVal_782) |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_14|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_46)) 0)) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| Int) (v_arrayElimCell_45 Int)) (or (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| |c_#StackHeapBarrier|)) (not (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| (store v_ArrVal_791 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| v_ArrVal_791) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| v_ArrVal_782) |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_14|)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_45)) 0)))) (= |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_14| Int)) (or (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_782 (Array Int Int))) (not (= (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| (store v_ArrVal_791 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| v_ArrVal_791) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_14| v_ArrVal_782) |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_14|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 4) 0)))))) is different from false [2022-10-17 11:00:24,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13500697] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 11:00:24,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-17 11:00:24,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2022-10-17 11:00:24,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637183449] [2022-10-17 11:00:24,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-17 11:00:24,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-17 11:00:24,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:00:24,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-17 11:00:24,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=784, Unknown=2, NotChecked=56, Total=930 [2022-10-17 11:00:24,587 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 27 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 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-10-17 11:00:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 11:00:24,940 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-10-17 11:00:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-17 11:00:24,941 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 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 36 [2022-10-17 11:00:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 11:00:24,942 INFO L225 Difference]: With dead ends: 33 [2022-10-17 11:00:24,942 INFO L226 Difference]: Without dead ends: 30 [2022-10-17 11:00:24,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=130, Invalid=1132, Unknown=2, NotChecked=68, Total=1332 [2022-10-17 11:00:24,944 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 11:00:24,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 169 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 4 Unchecked, 0.2s Time] [2022-10-17 11:00:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-17 11:00:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-17 11:00:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-10-17 11:00:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-10-17 11:00:24,952 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 36 [2022-10-17 11:00:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 11:00:24,952 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-10-17 11:00:24,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 21 states have internal predecessors, (46), 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-10-17 11:00:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-10-17 11:00:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-17 11:00:24,953 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 11:00:24,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 11:00:24,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-17 11:00:25,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 11:00:25,181 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 11:00:25,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:00:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 630247085, now seen corresponding path program 2 times [2022-10-17 11:00:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:00:25,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175438346] [2022-10-17 11:00:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:00:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:00:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:27,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 11:00:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:27,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-17 11:00:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 11:00:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:00:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 11:00:28,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:00:28,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175438346] [2022-10-17 11:00:28,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175438346] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 11:00:28,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373047183] [2022-10-17 11:00:28,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-17 11:00:28,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 11:00:28,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 11:00:28,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 11:00:28,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46107912-3a6f-44e9-a7d3-2372da9973ff/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-17 11:00:28,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-17 11:00:28,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 11:00:28,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 159 conjunts are in the unsatisfiable core [2022-10-17 11:00:28,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 11:00:28,646 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-10-17 11:00:28,693 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-10-17 11:00:28,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:28,837 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-10-17 11:00:28,954 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-10-17 11:00:28,960 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-10-17 11:00:29,202 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-17 11:00:29,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-17 11:00:29,210 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-10-17 11:00:29,232 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-17 11:00:29,233 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-10-17 11:00:29,358 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 [2022-10-17 11:00:29,370 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-10-17 11:00:29,379 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 20 treesize of output 22 [2022-10-17 11:00:29,883 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-10-17 11:00:29,884 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 115 treesize of output 46 [2022-10-17 11:00:29,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:29,896 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 13 treesize of output 9 [2022-10-17 11:00:29,904 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-10-17 11:00:29,910 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-10-17 11:00:30,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,231 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-17 11:00:30,232 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 123 treesize of output 105 [2022-10-17 11:00:30,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 102 [2022-10-17 11:00:30,273 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-10-17 11:00:30,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-10-17 11:00:30,295 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 28 treesize of output 30 [2022-10-17 11:00:30,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2022-10-17 11:00:30,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,480 INFO L356 Elim1Store]: treesize reduction 36, result has 12.2 percent of original size [2022-10-17 11:00:30,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 117 [2022-10-17 11:00:30,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,505 INFO L356 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2022-10-17 11:00:30,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 138 treesize of output 114 [2022-10-17 11:00:30,515 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 0 case distinctions, treesize of input 117 treesize of output 98 [2022-10-17 11:00:30,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:30,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 82 [2022-10-17 11:00:30,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-17 11:00:31,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-17 11:00:31,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:31,333 INFO L356 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-10-17 11:00:31,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 258 treesize of output 109 [2022-10-17 11:00:31,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:31,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 11:00:31,359 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-10-17 11:00:31,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 31 [2022-10-17 11:00:31,532 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-10-17 11:00:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 11:00:31,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 11:00:32,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_989 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4))) (let ((.cse3 (let ((.cse7 (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|) .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| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)))) (.cse0 (store (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|) .cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_989) |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 ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_982) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_986) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))))) is different from false [2022-10-17 11:00:32,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_986 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_989 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| (store v_ArrVal_998 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| v_ArrVal_998) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (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| 0)))) (.cse0 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| (store v_ArrVal_997 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| v_ArrVal_997) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| v_ArrVal_989) |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|)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| v_ArrVal_982) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_986) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17|) 0)) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_17| |c_#StackHeapBarrier|)))) is different from false [2022-10-17 11:00:32,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373047183] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 11:00:32,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-17 11:00:32,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2022-10-17 11:00:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975100478] [2022-10-17 11:00:32,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-17 11:00:32,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-17 11:00:32,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:00:32,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-17 11:00:32,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=2333, Unknown=4, NotChecked=194, Total=2652 [2022-10-17 11:00:32,246 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 44 states, 42 states have (on average 1.380952380952381) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)