./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- 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-b5237d8 [2022-11-21 16:36:00,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:36:00,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:36:00,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:36:00,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:36:00,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:36:00,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:36:00,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:36:00,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:36:00,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:36:00,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:36:00,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:36:00,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:36:00,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:36:00,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:36:00,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:36:00,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:36:00,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:36:00,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:36:00,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:36:00,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:36:00,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:36:00,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:36:00,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:36:00,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:36:00,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:36:00,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:36:00,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:36:00,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:36:00,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:36:00,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:36:00,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:36:00,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:36:00,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:36:00,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:36:00,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:36:00,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:36:00,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:36:00,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:36:00,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:36:00,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:36:00,987 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:36:01,008 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:36:01,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:36:01,009 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:36:01,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:36:01,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:36:01,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:36:01,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:36:01,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:36:01,011 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:36:01,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:36:01,012 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:36:01,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:36:01,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:36:01,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:36:01,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:36:01,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:36:01,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:36:01,014 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:36:01,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:36:01,014 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:36:01,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:36:01,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:36:01,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:36:01,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:36:01,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:36:01,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:36:01,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:36:01,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:36:01,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:36:01,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:36:01,017 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:36:01,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:36:01,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:36:01,018 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_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/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_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-11-21 16:36:01,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:36:01,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:36:01,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:36:01,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:36:01,383 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:36:01,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-21 16:36:04,464 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:36:04,720 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:36:04,721 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-21 16:36:04,732 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/data/b792c2308/5abe08ad9bfe4b53afbfe8bd0e6b18e3/FLAG1574eca57 [2022-11-21 16:36:04,747 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/data/b792c2308/5abe08ad9bfe4b53afbfe8bd0e6b18e3 [2022-11-21 16:36:04,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:36:04,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:36:04,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:36:04,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:36:04,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:36:04,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:36:04" (1/1) ... [2022-11-21 16:36:04,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3150b6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:04, skipping insertion in model container [2022-11-21 16:36:04,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:36:04" (1/1) ... [2022-11-21 16:36:04,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:36:04,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:36:05,204 WARN L237 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_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-21 16:36:05,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:36:05,231 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:36:05,291 WARN L237 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_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-21 16:36:05,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:36:05,316 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:36:05,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05 WrapperNode [2022-11-21 16:36:05,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:36:05,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:36:05,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:36:05,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:36:05,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,363 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-11-21 16:36:05,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:36:05,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:36:05,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:36:05,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:36:05,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,404 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:36:05,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:36:05,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:36:05,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:36:05,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (1/1) ... [2022-11-21 16:36:05,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:36:05,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:36:05,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:36:05,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:36:05,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:36:05,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:36:05,497 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-21 16:36:05,497 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-21 16:36:05,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:36:05,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:36:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:36:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:36:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:36:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:36:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:36:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:36:05,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:36:05,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:36:05,624 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:36:05,626 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:36:05,876 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:36:05,892 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:36:05,893 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 16:36:05,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:36:05 BoogieIcfgContainer [2022-11-21 16:36:05,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:36:05,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:36:05,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:36:05,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:36:05,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:36:04" (1/3) ... [2022-11-21 16:36:05,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70814732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:36:05, skipping insertion in model container [2022-11-21 16:36:05,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:05" (2/3) ... [2022-11-21 16:36:05,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70814732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:36:05, skipping insertion in model container [2022-11-21 16:36:05,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:36:05" (3/3) ... [2022-11-21 16:36:05,910 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-11-21 16:36:05,941 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:36:05,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:36:05,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:36:05,999 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;@564dd70d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:36:05,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:36:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:36:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:36:06,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:36:06,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:36:06,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:36:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2022-11-21 16:36:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:06,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141544138] [2022-11-21 16:36:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:06,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 16:36:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:36:06,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:06,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141544138] [2022-11-21 16:36:06,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141544138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:06,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:06,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:36:06,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928130140] [2022-11-21 16:36:06,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:06,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:06,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:06,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:06,419 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:36:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:36:06,490 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-11-21 16:36:06,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 19 [2022-11-21 16:36:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:36:06,500 INFO L225 Difference]: With dead ends: 54 [2022-11-21 16:36:06,500 INFO L226 Difference]: Without dead ends: 24 [2022-11-21 16:36:06,503 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-11-21 16:36:06,507 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:36:06,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:36:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-21 16:36:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-21 16:36:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:36:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-11-21 16:36:06,550 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2022-11-21 16:36:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:36:06,551 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-21 16:36:06,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:36:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-11-21 16:36:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:36:06,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:36:06,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:36:06,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:36:06,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:36:06,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2022-11-21 16:36:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:06,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508312780] [2022-11-21 16:36:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 16:36:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:36:06,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:06,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508312780] [2022-11-21 16:36:06,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508312780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:06,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:06,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:36:06,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805235908] [2022-11-21 16:36:06,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:06,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:36:06,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:06,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:36:06,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:36:06,919 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:36:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:36:06,987 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-21 16:36:06,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:36:06,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-11-21 16:36:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:36:06,989 INFO L225 Difference]: With dead ends: 46 [2022-11-21 16:36:06,990 INFO L226 Difference]: Without dead ends: 28 [2022-11-21 16:36:06,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:36:07,003 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:36:07,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:36:07,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-21 16:36:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-11-21 16:36:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:36:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-21 16:36:07,012 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-11-21 16:36:07,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:36:07,012 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-21 16:36:07,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:36:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-21 16:36:07,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 16:36:07,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:36:07,014 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, 1, 1, 1] [2022-11-21 16:36:07,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:36:07,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:36:07,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2022-11-21 16:36:07,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:07,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574428320] [2022-11-21 16:36:07,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:36:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:07,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 16:36:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:36:07,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574428320] [2022-11-21 16:36:07,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574428320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:36:07,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748045450] [2022-11-21 16:36:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:07,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:36:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:36:07,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:36:07,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:36:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:07,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:36:07,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:36:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:36:07,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:36:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:36:07,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748045450] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:36:07,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:36:07,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-21 16:36:07,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298318981] [2022-11-21 16:36:07,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:36:07,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:36:07,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:07,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:36:07,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:36:07,787 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 16:36:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:36:07,845 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-11-21 16:36:07,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:36:07,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-21 16:36:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:36:07,847 INFO L225 Difference]: With dead ends: 47 [2022-11-21 16:36:07,847 INFO L226 Difference]: Without dead ends: 29 [2022-11-21 16:36:07,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:36:07,849 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:36:07,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 64 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:36:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-21 16:36:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-21 16:36:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-11-21 16:36:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-21 16:36:07,856 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2022-11-21 16:36:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:36:07,857 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-21 16:36:07,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 16:36:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-21 16:36:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 16:36:07,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:36:07,858 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, 1] [2022-11-21 16:36:07,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:36:08,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:36:08,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:36:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:08,067 INFO L85 PathProgramCache]: Analyzing trace with hash -941011836, now seen corresponding path program 2 times [2022-11-21 16:36:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:08,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031734168] [2022-11-21 16:36:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:08,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:36:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:36:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:36:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 16:36:08,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:08,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031734168] [2022-11-21 16:36:08,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031734168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:08,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:08,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:36:08,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952687832] [2022-11-21 16:36:08,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:08,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:36:08,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:36:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:36:08,227 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:36:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:36:08,295 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-11-21 16:36:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:36:08,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-11-21 16:36:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:36:08,302 INFO L225 Difference]: With dead ends: 45 [2022-11-21 16:36:08,303 INFO L226 Difference]: Without dead ends: 38 [2022-11-21 16:36:08,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:36:08,308 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:36:08,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:36:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-21 16:36:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-11-21 16:36:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:36:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-11-21 16:36:08,325 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 37 [2022-11-21 16:36:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:36:08,326 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-11-21 16:36:08,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:36:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-11-21 16:36:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 16:36:08,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:36:08,332 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, 1] [2022-11-21 16:36:08,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:36:08,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:36:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 1 times [2022-11-21 16:36:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:08,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694894124] [2022-11-21 16:36:08,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:08,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:08,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:36:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:08,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:36:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:08,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:36:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 16:36:08,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:08,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694894124] [2022-11-21 16:36:08,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694894124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:08,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:08,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:36:08,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434244498] [2022-11-21 16:36:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:08,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:36:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:08,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:36:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:36:08,708 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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-11-21 16:36:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:36:08,771 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-21 16:36:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:36:08,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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) Word has length 37 [2022-11-21 16:36:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:36:08,776 INFO L225 Difference]: With dead ends: 38 [2022-11-21 16:36:08,776 INFO L226 Difference]: Without dead ends: 30 [2022-11-21 16:36:08,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:36:08,778 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:36:08,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:36:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-21 16:36:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-21 16:36:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:36:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-21 16:36:08,797 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 37 [2022-11-21 16:36:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:36:08,797 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-21 16:36:08,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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-11-21 16:36:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-21 16:36:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 16:36:08,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:36:08,799 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, 1, 1] [2022-11-21 16:36:08,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:36:08,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:36:08,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:08,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2022-11-21 16:36:08,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:08,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896830511] [2022-11-21 16:36:08,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:08,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:36:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:09,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:36:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:09,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:36:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:36:10,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:10,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896830511] [2022-11-21 16:36:10,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896830511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:36:10,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816706606] [2022-11-21 16:36:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:10,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:36:10,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:36:10,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:36:10,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:36:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:10,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 16:36:10,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:36:10,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 16:36:10,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:36:10,813 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 17 [2022-11-21 16:36:11,131 INFO L321 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2022-11-21 16:36:11,132 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 30 treesize of output 63 [2022-11-21 16:36:15,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:36:16,029 INFO L321 Elim1Store]: treesize reduction 72, result has 54.1 percent of original size [2022-11-21 16:36:16,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 79 treesize of output 155 [2022-11-21 16:36:18,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:36:26,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-21 16:36:40,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:36:41,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-21 16:36:41,836 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:36:41,839 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:36:42,076 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:36:42,080 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:36:42,573 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:36:42,578 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:36:43,733 INFO L350 Elim1Store]: Elim1 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 96 treesize of output 94 [2022-11-21 16:36:43,856 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 73 [2022-11-21 16:36:44,303 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:36:44,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2022-11-21 16:36:44,322 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:36:44,493 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:36:44,662 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:36:44,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-11-21 16:36:44,933 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2022-11-21 16:36:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:36:44,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:36:44,952 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2022-11-21 16:36:45,308 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (|ULTIMATE.start_sll_insert_~head#1.base| Int) (v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| |c_#StackHeapBarrier|)) (= 0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11|) (not (= 0 (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_551))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11|)))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_548) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-21 16:36:45,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816706606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:36:45,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:36:45,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2022-11-21 16:36:45,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301837667] [2022-11-21 16:36:45,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:36:45,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-21 16:36:45,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:45,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-21 16:36:45,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=993, Unknown=16, NotChecked=130, Total=1260 [2022-11-21 16:36:45,319 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 25 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-21 16:36:57,884 WARN L233 SmtUtils]: Spent 8.50s on a formula simplification. DAG size of input: 65 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:36:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:36:58,174 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-11-21 16:36:58,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 16:36:58,179 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 25 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-11-21 16:36:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:36:58,180 INFO L225 Difference]: With dead ends: 55 [2022-11-21 16:36:58,180 INFO L226 Difference]: Without dead ends: 48 [2022-11-21 16:36:58,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=336, Invalid=1912, Unknown=16, NotChecked=186, Total=2450 [2022-11-21 16:36:58,183 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 218 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:36:58,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 168 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:36:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-21 16:36:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2022-11-21 16:36:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:36:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-21 16:36:58,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 38 [2022-11-21 16:36:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:36:58,193 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-21 16:36:58,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 25 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-21 16:36:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-11-21 16:36:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 16:36:58,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:36:58,195 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, 1, 1] [2022-11-21 16:36:58,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:36:58,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 16:36:58,403 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:36:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1457379225, now seen corresponding path program 1 times [2022-11-21 16:36:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:58,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599311726] [2022-11-21 16:36:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:59,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:36:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:36:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:00,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:37:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:37:00,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:37:00,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599311726] [2022-11-21 16:37:00,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599311726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:37:00,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103914795] [2022-11-21 16:37:00,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:37:00,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:37:00,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:37:00,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:37:00,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:37:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:01,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 126 conjunts are in the unsatisfiable core [2022-11-21 16:37:01,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:37:01,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:37:01,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:37:01,312 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:37:01,312 INFO L350 Elim1Store]: Elim1 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-11-21 16:37:01,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:37:01,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:37:01,684 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:37:01,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:37:01,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:01,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 16:37:02,161 INFO L350 Elim1Store]: Elim1 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-11-21 16:37:02,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:37:02,177 INFO L350 Elim1Store]: Elim1 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-11-21 16:37:02,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:02,502 INFO L350 Elim1Store]: Elim1 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-11-21 16:37:02,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:02,519 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 16:37:02,520 INFO L350 Elim1Store]: Elim1 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-11-21 16:37:02,530 INFO L350 Elim1Store]: Elim1 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-11-21 16:37:02,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:02,557 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-21 16:37:02,969 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:37:02,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 71 [2022-11-21 16:37:02,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:02,984 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 28 [2022-11-21 16:37:02,993 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 27 [2022-11-21 16:37:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:03,161 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 43 [2022-11-21 16:37:03,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:03,173 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 32 [2022-11-21 16:37:03,184 INFO L350 Elim1Store]: Elim1 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-11-21 16:37:03,335 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 24 [2022-11-21 16:37:03,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-11-21 16:37:03,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:37:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:37:03,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:37:03,499 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_728) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-21 16:37:03,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_727 Int) (v_ArrVal_730 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_727)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_728) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-21 16:37:03,562 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| Int) (v_ArrVal_727 Int) (v_ArrVal_730 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 v_ArrVal_727)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_728) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-21 16:37:06,546 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_738 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| Int) (v_ArrVal_727 Int) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_739))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14|) 0)) (= (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_740))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_738))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_727))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_728) (select (select (store (store .cse3 .cse1 v_ArrVal_724) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_729) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| |c_#StackHeapBarrier|))))) is different from false [2022-11-21 16:37:06,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103914795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:37:06,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:37:06,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2022-11-21 16:37:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009403384] [2022-11-21 16:37:06,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:37:06,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-21 16:37:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:37:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-21 16:37:06,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1502, Unknown=30, NotChecked=324, Total=1980 [2022-11-21 16:37:06,554 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 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-11-21 16:37:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:37:09,234 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-11-21 16:37:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 16:37:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 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 38 [2022-11-21 16:37:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:37:09,236 INFO L225 Difference]: With dead ends: 45 [2022-11-21 16:37:09,236 INFO L226 Difference]: Without dead ends: 43 [2022-11-21 16:37:09,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=327, Invalid=2629, Unknown=30, NotChecked=436, Total=3422 [2022-11-21 16:37:09,239 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 172 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:37:09,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 243 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:37:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-21 16:37:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2022-11-21 16:37:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:37:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-21 16:37:09,260 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 38 [2022-11-21 16:37:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:37:09,261 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-21 16:37:09,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 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-11-21 16:37:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-21 16:37:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 16:37:09,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:37:09,263 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, 1, 1, 1] [2022-11-21 16:37:09,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:37:09,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:37:09,471 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:37:09,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:37:09,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1501961106, now seen corresponding path program 2 times [2022-11-21 16:37:09,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:37:09,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331990231] [2022-11-21 16:37:09,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:37:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:37:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:37:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:09,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:37:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:09,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:37:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 16:37:09,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:37:09,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331990231] [2022-11-21 16:37:09,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331990231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:37:09,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:37:09,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:37:09,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946728747] [2022-11-21 16:37:09,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:37:09,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:37:09,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:37:09,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:37:09,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:37:09,752 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:37:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:37:09,828 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-11-21 16:37:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:37:09,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-21 16:37:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:37:09,829 INFO L225 Difference]: With dead ends: 42 [2022-11-21 16:37:09,830 INFO L226 Difference]: Without dead ends: 32 [2022-11-21 16:37:09,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:37:09,832 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:37:09,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 55 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:37:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-21 16:37:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-21 16:37:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 16:37:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-11-21 16:37:09,854 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 39 [2022-11-21 16:37:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:37:09,856 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-11-21 16:37:09,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:37:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-11-21 16:37:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 16:37:09,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:37:09,860 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, 1, 1, 1, 1] [2022-11-21 16:37:09,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:37:09,861 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:37:09,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:37:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash 382129514, now seen corresponding path program 1 times [2022-11-21 16:37:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:37:09,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736624552] [2022-11-21 16:37:09,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:37:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:37:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:11,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:37:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:11,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:37:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:11,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:37:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:37:11,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:37:11,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736624552] [2022-11-21 16:37:11,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736624552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:37:11,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112315230] [2022-11-21 16:37:11,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:37:11,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:37:11,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:37:11,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:37:11,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bf8e38-ca09-41e9-a5c6-43770f5ad570/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:37:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:37:12,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-21 16:37:12,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:37:12,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:37:12,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:37:12,921 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 16:37:12,921 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 20 [2022-11-21 16:37:12,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:37:12,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-21 16:37:13,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:13,262 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 16:37:13,263 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 45 treesize of output 47 [2022-11-21 16:37:13,283 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 16:37:13,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 16:37:13,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:37:13,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 16:37:13,887 INFO L321 Elim1Store]: treesize reduction 88, result has 50.6 percent of original size [2022-11-21 16:37:13,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 93 treesize of output 138 [2022-11-21 16:37:13,919 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-21 16:37:13,919 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-21 16:37:19,782 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ 2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse37 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse66 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse33 (select .cse37 4))) (let ((.cse26 (not (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|))) (.cse28 (<= (+ 2 |c_ULTIMATE.start_sll_insert_~last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse29 (not (= .cse33 0))) (.cse0 (<= (+ 2 .cse4) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse4)) (.cse6 (= .cse66 |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (.cse24 (not (= .cse66 0))) (.cse31 (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| 4))) (.cse25 (not (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| 0))) (.cse22 (not (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse4))) (.cse23 (not (= 0 .cse4)))) (or (and .cse0 (or (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse2 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse2)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse1))))) (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse3)) (not (= .cse3 .cse4)) (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse5 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse5)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse5) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (and .cse6 (or (and .cse7 (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse9 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse8)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))) (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse10)) (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse11 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse10) .cse11)) (= (select (select |c_#memory_$Pointer$.offset| .cse10) .cse11) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (not (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse12)) (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse13 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse12) .cse13)) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse13)) (= (select (select |c_#memory_$Pointer$.offset| .cse12) .cse13) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))))) (and .cse7 (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse15 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse14)) (not (= .cse14 .cse4)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse14) .cse15)) (= (select (select |c_#memory_$Pointer$.offset| .cse14) .cse15) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))) (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse16)) (not (= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse17 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse16) .cse17)) (= (select (select |c_#memory_$Pointer$.offset| .cse16) .cse17) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))) (and .cse7 (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse19 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse18)) (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse18) .cse19)) (= (select (select |c_#memory_$Pointer$.offset| .cse18) .cse19) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))) (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse20)) (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse21 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse20) .cse21)) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse21)) (= (select (select |c_#memory_$Pointer$.offset| .cse20) .cse21) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (not (= .cse20 .cse4)))))) .cse22 .cse23 .cse24) (and .cse25 .cse26 (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse27)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse27) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse28 .cse29) (and (let ((.cse30 (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse34 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse34) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|)) (= .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (or (and .cse30 .cse31) (exists ((|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|)) (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int)) (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse32) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (and (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse33) .cse30))) .cse25 .cse26 .cse28 .cse29) (and .cse0 (let ((.cse35 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|))) (or (and .cse7 (= (select .cse35 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse33)) (and (let ((.cse40 (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse44 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| (select .cse35 .cse44)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select .cse37 .cse44))))))) (let ((.cse39 (not .cse7)) (.cse42 (and .cse6 .cse40)) (.cse38 (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse43 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| (select .cse35 .cse43)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select .cse37 .cse43)) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse43))))))) (or (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse36 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| (select .cse35 .cse36)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select .cse37 .cse36)) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse36))))) (and .cse38 .cse39) (and (not (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (and .cse39 .cse40) (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse41 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| (select .cse35 .cse41)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select .cse37 .cse41))))) .cse42)) (and .cse7 (or .cse42 .cse40)) (and .cse6 .cse38)))) .cse24))) .cse22 .cse23) (and .cse25 (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.base| .cse45)) (not (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse45)) (= .cse45 .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse45) 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= (+ 2 .cse45) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| .cse45) 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (not (= .cse45 0)))))) (and .cse0 (let ((.cse64 (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse65 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (= .cse65 .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse65) 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| .cse65) 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (not (= |ULTIMATE.start_sll_insert_~head#1.offset| 4))))))) (or (and (or (and .cse6 (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse47 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse46 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.offset| .cse46)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse47) .cse46)) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse46)) (= (select (select |c_#memory_$Pointer$.offset| .cse47) .cse46) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))) (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse48 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.offset| .cse48)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse49) .cse48)) (= (select (select |c_#memory_$Pointer$.offset| .cse49) .cse48) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse48))))) (exists ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse50 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse50)) (exists ((|ULTIMATE.start_sll_insert_~head#1.offset| Int)) (and (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int)) (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= .cse51 .cse4)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse51) .cse50)) (= (select (select |c_#memory_$Pointer$.offset| .cse51) .cse50) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (not (= |ULTIMATE.start_sll_insert_~head#1.offset| .cse50)))))))) .cse24) (and .cse7 (or (exists ((|ULTIMATE.start_sll_insert_~head#1.offset| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse53 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int)) (let ((.cse52 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse52) .cse53)) (= (select (select |c_#memory_$Pointer$.offset| .cse52) .cse53) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (not (= |ULTIMATE.start_sll_insert_~head#1.offset| .cse53)) (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0))))) (exists ((|ULTIMATE.start_sll_insert_~head#1.offset| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse55 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int)) (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= .cse54 .cse4)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse54) .cse55)) (= (select (select |c_#memory_$Pointer$.offset| .cse54) .cse55) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (not (= |ULTIMATE.start_sll_insert_~head#1.offset| .cse55))))) (and (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse57 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse56 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.offset| .cse56)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse57) .cse56)) (= (select (select |c_#memory_$Pointer$.offset| .cse57) .cse56) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) .cse6)) .cse24) (and (or (exists ((|ULTIMATE.start_sll_insert_~head#1.offset| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse58 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.offset| .cse58)) (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int)) (let ((.cse59 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse59) .cse58)) (= (select (select |c_#memory_$Pointer$.offset| .cse59) .cse58) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (not (= .cse59 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (exists ((|ULTIMATE.start_sll_insert_~head#1.offset| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse60 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.offset| .cse60)) (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int)) (let ((.cse61 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= .cse61 .cse4)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse61) .cse60)) (= (select (select |c_#memory_$Pointer$.offset| .cse61) .cse60) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (not (= .cse61 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (and .cse6 (exists ((|ULTIMATE.start_sll_insert_~head#1.base| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse62 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (.cse63 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_insert_~head#1.offset| .cse62)) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse63) .cse62)) (= (select (select |c_#memory_$Pointer$.offset| .cse63) .cse62) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (not (= .cse63 |c_ULTIMATE.start_main_~#s~0#1.base|))))))) .cse24) (and .cse25 .cse64 .cse31) (and .cse25 .cse64))) .cse22 .cse23)))))) is different from true [2022-11-21 16:37:20,376 INFO L190 IndexEqualityManager]: detected not equals via solver