./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN --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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- 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-6b4ec56 [2022-11-20 11:57:20,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:57:20,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:57:20,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:57:20,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:57:20,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:57:20,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:57:20,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:57:20,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:57:20,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:57:20,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:57:20,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:57:20,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:57:20,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:57:20,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:57:20,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:57:20,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:57:20,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:57:20,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:57:20,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:57:20,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:57:20,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:57:20,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:57:20,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:57:20,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:57:20,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:57:20,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:57:20,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:57:20,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:57:20,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:57:20,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:57:20,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:57:20,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:57:20,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:57:20,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:57:20,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:57:20,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:57:20,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:57:20,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:57:20,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:57:20,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:57:20,660 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:57:20,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:57:20,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:57:20,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:57:20,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:57:20,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:57:20,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:57:20,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:57:20,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:57:20,689 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:57:20,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:57:20,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:57:20,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:57:20,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:57:20,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:57:20,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:57:20,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:57:20,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:57:20,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:57:20,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:57:20,693 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:57:20,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:57:20,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:57:20,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:57:20,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:57:20,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:57:20,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:57:20,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:57:20,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:57:20,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:57:20,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:57:20,696 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:57:20,697 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:57:20,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:57:20,697 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_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/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_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-11-20 11:57:20,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:57:21,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:57:21,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:57:21,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:57:21,016 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:57:21,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-20 11:57:24,203 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:57:24,472 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:57:24,473 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-20 11:57:24,485 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/data/4fd74ab91/4ddd407927874a1eb51181acbe77f121/FLAGdb05c49f7 [2022-11-20 11:57:24,501 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/data/4fd74ab91/4ddd407927874a1eb51181acbe77f121 [2022-11-20 11:57:24,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:57:24,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:57:24,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:57:24,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:57:24,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:57:24,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:24,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4efe6f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24, skipping insertion in model container [2022-11-20 11:57:24,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:24,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:57:24,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:57:24,884 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_b305084e-20ea-4d96-bf4c-7ce6f5615913/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-20 11:57:24,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:57:24,899 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:57:24,944 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_b305084e-20ea-4d96-bf4c-7ce6f5615913/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-20 11:57:24,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:57:24,972 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:57:24,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24 WrapperNode [2022-11-20 11:57:24,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:57:24,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:57:24,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:57:24,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:57:24,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:24,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:25,027 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2022-11-20 11:57:25,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:57:25,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:57:25,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:57:25,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:57:25,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:25,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:25,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:25,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:25,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:25,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:25,085 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:25,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:25,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:57:25,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:57:25,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:57:25,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:57:25,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (1/1) ... [2022-11-20 11:57:25,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:57:25,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:25,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:57:25,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:57:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:57:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:57:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 11:57:25,203 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 11:57:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:57:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:57:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:57:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:57:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:57:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:57:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:57:25,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:57:25,397 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:57:25,400 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:57:25,787 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:57:25,795 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:57:25,795 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 11:57:25,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:57:25 BoogieIcfgContainer [2022-11-20 11:57:25,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:57:25,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:57:25,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:57:25,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:57:25,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:57:24" (1/3) ... [2022-11-20 11:57:25,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea09eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:57:25, skipping insertion in model container [2022-11-20 11:57:25,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:57:24" (2/3) ... [2022-11-20 11:57:25,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea09eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:57:25, skipping insertion in model container [2022-11-20 11:57:25,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:57:25" (3/3) ... [2022-11-20 11:57:25,809 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-11-20 11:57:25,832 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:57:25,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:57:25,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:57:25,910 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;@7402f0e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:57:25,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:57:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 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-20 11:57:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:57:25,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:25,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:25,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:25,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:25,938 INFO L85 PathProgramCache]: Analyzing trace with hash 663980757, now seen corresponding path program 1 times [2022-11-20 11:57:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:25,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897496506] [2022-11-20 11:57:25,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:26,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:26,368 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-20 11:57:26,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:26,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897496506] [2022-11-20 11:57:26,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897496506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:26,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:57:26,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:57:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664798262] [2022-11-20 11:57:26,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:26,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:57:26,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:26,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:57:26,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:57:26,423 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 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 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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-20 11:57:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:26,528 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-11-20 11:57:26,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:57:26,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 20 [2022-11-20 11:57:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:26,540 INFO L225 Difference]: With dead ends: 61 [2022-11-20 11:57:26,541 INFO L226 Difference]: Without dead ends: 28 [2022-11-20 11:57:26,544 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-20 11:57:26,549 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:26,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:57:26,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-20 11:57:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-20 11:57:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-20 11:57:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-20 11:57:26,595 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2022-11-20 11:57:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:26,598 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-20 11:57:26,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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-20 11:57:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-20 11:57:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:57:26,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:26,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:26,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:57:26,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:26,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:26,605 INFO L85 PathProgramCache]: Analyzing trace with hash 616475652, now seen corresponding path program 1 times [2022-11-20 11:57:26,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:26,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650873591] [2022-11-20 11:57:26,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:26,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:26,877 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-20 11:57:26,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:26,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650873591] [2022-11-20 11:57:26,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650873591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:26,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:57:26,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:57:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720118606] [2022-11-20 11:57:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:26,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:57:26,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:26,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:57:26,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:57:26,882 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-20 11:57:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:26,924 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-11-20 11:57:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:57:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2022-11-20 11:57:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:26,926 INFO L225 Difference]: With dead ends: 47 [2022-11-20 11:57:26,926 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 11:57:26,927 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-20 11:57:26,928 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 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-20 11:57:26,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:57:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 11:57:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-20 11:57:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-20 11:57:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-20 11:57:26,937 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2022-11-20 11:57:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:26,938 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-20 11:57:26,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-20 11:57:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-20 11:57:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:57:26,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:26,940 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-20 11:57:26,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:57:26,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash -600691076, now seen corresponding path program 1 times [2022-11-20 11:57:26,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:26,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876030432] [2022-11-20 11:57:26,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:26,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,432 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-20 11:57:27,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:27,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876030432] [2022-11-20 11:57:27,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876030432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:27,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895733449] [2022-11-20 11:57:27,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:27,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:27,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:27,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:57:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:57:27,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:57:27,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:57:27,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895733449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:27,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:57:27,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-20 11:57:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074601544] [2022-11-20 11:57:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:27,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:57:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:27,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:57:27,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:57:27,668 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-20 11:57:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:27,710 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-11-20 11:57:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:57:27,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 28 [2022-11-20 11:57:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:27,712 INFO L225 Difference]: With dead ends: 51 [2022-11-20 11:57:27,713 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 11:57:27,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:57:27,715 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:27,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 59 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:57:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 11:57:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-11-20 11:57:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-20 11:57:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-11-20 11:57:27,724 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 28 [2022-11-20 11:57:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:27,725 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-11-20 11:57:27,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-20 11:57:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-11-20 11:57:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 11:57:27,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:27,727 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, 1, 1, 1, 1, 1] [2022-11-20 11:57:27,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:27,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:27,936 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:27,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1948852891, now seen corresponding path program 1 times [2022-11-20 11:57:27,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:27,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156010266] [2022-11-20 11:57:27,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:27,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:28,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:28,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:57:28,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:28,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156010266] [2022-11-20 11:57:28,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156010266] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:28,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324583752] [2022-11-20 11:57:28,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:28,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:28,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:28,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:28,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:57:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:28,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:57:28,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:57:28,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:57:28,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324583752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:28,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:57:28,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-11-20 11:57:28,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811960483] [2022-11-20 11:57:28,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:28,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:57:28,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:57:28,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:57:28,489 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-20 11:57:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:28,578 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-11-20 11:57:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:57:28,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 33 [2022-11-20 11:57:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:28,582 INFO L225 Difference]: With dead ends: 57 [2022-11-20 11:57:28,584 INFO L226 Difference]: Without dead ends: 43 [2022-11-20 11:57:28,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:57:28,588 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:28,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 83 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:57:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-20 11:57:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-11-20 11:57:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 11:57:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-11-20 11:57:28,605 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 33 [2022-11-20 11:57:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:28,607 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-11-20 11:57:28,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-20 11:57:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-11-20 11:57:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:57:28,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:28,613 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, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:28,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:28,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:28,820 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2082169171, now seen corresponding path program 1 times [2022-11-20 11:57:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:28,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353792794] [2022-11-20 11:57:28,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:29,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:29,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:57:29,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:29,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353792794] [2022-11-20 11:57:29,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353792794] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:29,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134101435] [2022-11-20 11:57:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:29,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:29,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:29,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:29,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:57:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:29,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:57:29,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 11:57:29,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:57:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 11:57:29,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134101435] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:57:29,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:57:29,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-11-20 11:57:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027410738] [2022-11-20 11:57:29,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:57:29,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:57:29,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:29,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:57:29,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:57:29,430 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 11:57:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:29,561 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-11-20 11:57:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:57:29,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-11-20 11:57:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:29,565 INFO L225 Difference]: With dead ends: 56 [2022-11-20 11:57:29,565 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 11:57:29,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:57:29,568 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:29,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 101 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:57:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 11:57:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2022-11-20 11:57:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 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-20 11:57:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-11-20 11:57:29,593 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 34 [2022-11-20 11:57:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:29,593 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-11-20 11:57:29,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 11:57:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-11-20 11:57:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:57:29,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:29,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:29,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:29,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:29,813 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1439163348, now seen corresponding path program 2 times [2022-11-20 11:57:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:29,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84086820] [2022-11-20 11:57:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:29,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:30,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 11:57:30,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:30,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84086820] [2022-11-20 11:57:30,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84086820] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:30,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623053700] [2022-11-20 11:57:30,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:57:30,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:30,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:30,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:30,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:57:30,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:57:30,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:57:30,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:57:30,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 11:57:30,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:57:30,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623053700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:30,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:57:30,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-20 11:57:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259758540] [2022-11-20 11:57:30,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:30,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:57:30,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:30,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:57:30,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:57:30,401 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-20 11:57:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:30,459 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-11-20 11:57:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:57:30,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 39 [2022-11-20 11:57:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:30,465 INFO L225 Difference]: With dead ends: 53 [2022-11-20 11:57:30,465 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 11:57:30,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:57:30,467 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:30,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 83 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:57:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 11:57:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-11-20 11:57:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-20 11:57:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-11-20 11:57:30,487 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 39 [2022-11-20 11:57:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:30,487 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-11-20 11:57:30,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-20 11:57:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-11-20 11:57:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:57:30,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:30,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:30,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:30,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:30,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:30,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1716044715, now seen corresponding path program 1 times [2022-11-20 11:57:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:30,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582439293] [2022-11-20 11:57:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:33,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:33,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:57:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:33,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582439293] [2022-11-20 11:57:33,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582439293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:33,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619544360] [2022-11-20 11:57:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:33,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:33,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:33,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:33,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:57:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:33,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-20 11:57:33,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:33,654 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-20 11:57:33,964 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:57:33,964 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 11 treesize of output 11 [2022-11-20 11:57:34,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:57:34,149 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:57:34,150 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 19 treesize of output 22 [2022-11-20 11:57:34,517 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:57:34,518 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 58 treesize of output 55 [2022-11-20 11:57:34,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-20 11:57:34,537 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 32 treesize of output 34 [2022-11-20 11:57:34,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:57:34,806 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 43 treesize of output 38 [2022-11-20 11:57:34,816 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 28 treesize of output 30 [2022-11-20 11:57:34,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:57:34,825 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 34 [2022-11-20 11:57:35,087 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 33 treesize of output 21 [2022-11-20 11:57:35,094 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 21 treesize of output 13 [2022-11-20 11:57:35,157 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 19 treesize of output 7 [2022-11-20 11:57:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:57:35,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:57:35,632 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_623) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_622)) |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_circular_update_at_~head#1.base| (store .cse3 .cse2 v_ArrVal_625)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_623) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_622)) |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_circular_update_at_~head#1.base| (store .cse3 .cse2 v_ArrVal_625)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1) .cse0)))) is different from false [2022-11-20 11:57:36,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:57:36,269 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-20 11:57:36,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:57:36,285 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-20 11:57:36,296 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 39 treesize of output 23 [2022-11-20 11:57:36,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:57:36,401 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-20 11:57:36,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:57:36,417 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-20 11:57:36,430 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 39 treesize of output 23 [2022-11-20 11:57:36,513 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (forall ((v_ArrVal_619 (Array Int Int)) (v_ArrVal_625 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_625) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2022-11-20 11:57:36,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:57:36,621 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2022-11-20 11:57:36,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:57:36,630 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 15 treesize of output 13 [2022-11-20 11:57:36,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:57:36,658 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 7 treesize of output 5 [2022-11-20 11:57:36,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:57:36,678 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:57:36,678 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 7 treesize of output 7 [2022-11-20 11:57:36,879 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_618) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-11-20 11:57:37,066 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_616))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_618)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-11-20 11:57:37,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:57:37,093 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2022-11-20 11:57:37,099 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 285 treesize of output 267 [2022-11-20 11:57:37,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:57:37,107 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 240 treesize of output 232 [2022-11-20 11:57:37,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:57:37,116 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 229 treesize of output 211 [2022-11-20 11:57:37,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:57:37,134 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 134 treesize of output 122 [2022-11-20 11:57:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 11:57:37,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619544360] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:57:37,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:57:37,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 63 [2022-11-20 11:57:37,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034901386] [2022-11-20 11:57:37,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:57:37,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-20 11:57:37,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:37,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-20 11:57:37,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3207, Unknown=22, NotChecked=468, Total=3906 [2022-11-20 11:57:37,818 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 63 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 54 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 11:57:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:43,175 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-11-20 11:57:43,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 11:57:43,176 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 54 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-11-20 11:57:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:43,180 INFO L225 Difference]: With dead ends: 89 [2022-11-20 11:57:43,180 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 11:57:43,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=415, Invalid=5129, Unknown=22, NotChecked=596, Total=6162 [2022-11-20 11:57:43,183 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 213 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:43,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 692 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 993 Invalid, 0 Unknown, 347 Unchecked, 1.0s Time] [2022-11-20 11:57:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 11:57:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 62. [2022-11-20 11:57:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:57:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-11-20 11:57:43,219 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 40 [2022-11-20 11:57:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:43,219 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-11-20 11:57:43,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 54 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 11:57:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-11-20 11:57:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:57:43,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:43,222 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:43,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:43,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:43,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:43,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1709432500, now seen corresponding path program 2 times [2022-11-20 11:57:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:43,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576228205] [2022-11-20 11:57:43,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:43,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:43,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 11:57:43,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:43,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576228205] [2022-11-20 11:57:43,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576228205] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:43,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758413781] [2022-11-20 11:57:43,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:57:43,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:43,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:43,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:43,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:57:43,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:57:43,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:57:43,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:57:43,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 11:57:43,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:57:43,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758413781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:43,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:57:43,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-11-20 11:57:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442327125] [2022-11-20 11:57:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:43,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:57:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:43,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:57:43,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:57:43,895 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-20 11:57:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:43,976 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2022-11-20 11:57:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:57:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 41 [2022-11-20 11:57:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:43,980 INFO L225 Difference]: With dead ends: 71 [2022-11-20 11:57:43,980 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 11:57:43,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:57:43,982 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 33 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:43,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 83 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:57:43,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 11:57:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-20 11:57:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 58 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:57:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-11-20 11:57:44,016 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 41 [2022-11-20 11:57:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:44,017 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-11-20 11:57:44,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-20 11:57:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-11-20 11:57:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:57:44,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:44,024 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:44,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:44,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 11:57:44,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:44,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:44,232 INFO L85 PathProgramCache]: Analyzing trace with hash 227314337, now seen corresponding path program 3 times [2022-11-20 11:57:44,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:44,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839052745] [2022-11-20 11:57:44,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:44,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 11:57:44,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:44,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839052745] [2022-11-20 11:57:44,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839052745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:44,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304188275] [2022-11-20 11:57:44,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:57:44,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:44,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:44,479 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:44,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:57:44,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 11:57:44,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:57:44,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:57:44,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:57:44,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:57:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:57:44,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304188275] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:44,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:57:44,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 5] total 12 [2022-11-20 11:57:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897074397] [2022-11-20 11:57:44,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:44,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:57:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:44,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:57:44,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:57:44,945 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-20 11:57:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:45,010 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2022-11-20 11:57:45,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:57:45,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 41 [2022-11-20 11:57:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:45,013 INFO L225 Difference]: With dead ends: 80 [2022-11-20 11:57:45,013 INFO L226 Difference]: Without dead ends: 68 [2022-11-20 11:57:45,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:57:45,016 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:45,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:57:45,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-20 11:57:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2022-11-20 11:57:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 58 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:57:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-11-20 11:57:45,039 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 41 [2022-11-20 11:57:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:45,040 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-11-20 11:57:45,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-20 11:57:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-11-20 11:57:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:57:45,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:45,042 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:45,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:45,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:45,251 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1346076317, now seen corresponding path program 4 times [2022-11-20 11:57:45,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:45,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614901928] [2022-11-20 11:57:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:45,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 11:57:45,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:45,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614901928] [2022-11-20 11:57:45,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614901928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:45,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228292173] [2022-11-20 11:57:45,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:57:45,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:45,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:45,529 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:45,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:57:45,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:57:45,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:57:45,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:57:45,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:57:45,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:57:45,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228292173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:45,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:57:45,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2022-11-20 11:57:45,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080063024] [2022-11-20 11:57:45,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:45,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:57:45,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:57:45,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:57:45,762 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-20 11:57:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:45,841 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-11-20 11:57:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:57:45,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 41 [2022-11-20 11:57:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:45,842 INFO L225 Difference]: With dead ends: 85 [2022-11-20 11:57:45,843 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 11:57:45,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:57:45,844 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:45,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 60 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:57:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 11:57:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-20 11:57:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:57:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-11-20 11:57:45,859 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 41 [2022-11-20 11:57:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:45,859 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-11-20 11:57:45,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-20 11:57:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-11-20 11:57:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:57:45,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:45,861 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:45,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:46,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:57:46,068 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash 474143318, now seen corresponding path program 1 times [2022-11-20 11:57:46,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:46,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616230715] [2022-11-20 11:57:46,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:46,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:57:47,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:47,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616230715] [2022-11-20 11:57:47,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616230715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:47,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11261805] [2022-11-20 11:57:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:47,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:47,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:47,191 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:47,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:57:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:47,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-20 11:57:47,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:47,626 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 17 treesize of output 13 [2022-11-20 11:57:47,938 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 19 treesize of output 7 [2022-11-20 11:57:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:57:48,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:57:48,416 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 38 treesize of output 32 [2022-11-20 11:57:48,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:57:48,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:57:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:57:48,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11261805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:57:48,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:57:48,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 11] total 36 [2022-11-20 11:57:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135279415] [2022-11-20 11:57:48,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:57:48,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 11:57:48,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:48,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 11:57:48,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1155, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 11:57:48,666 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 34 states have internal predecessors, (105), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 11:57:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:51,155 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2022-11-20 11:57:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 11:57:51,156 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 34 states have internal predecessors, (105), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-11-20 11:57:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:51,158 INFO L225 Difference]: With dead ends: 175 [2022-11-20 11:57:51,158 INFO L226 Difference]: Without dead ends: 173 [2022-11-20 11:57:51,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=486, Invalid=2820, Unknown=0, NotChecked=0, Total=3306 [2022-11-20 11:57:51,160 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 591 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:51,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 649 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 11:57:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-20 11:57:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 106. [2022-11-20 11:57:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 101 states have internal predecessors, (117), 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-20 11:57:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-11-20 11:57:51,198 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 46 [2022-11-20 11:57:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:51,200 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-11-20 11:57:51,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 34 states have internal predecessors, (105), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 11:57:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-11-20 11:57:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:57:51,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:51,201 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2022-11-20 11:57:51,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:51,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 11:57:51,408 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash 216494684, now seen corresponding path program 5 times [2022-11-20 11:57:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:51,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412167462] [2022-11-20 11:57:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:51,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:57:51,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:51,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412167462] [2022-11-20 11:57:51,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412167462] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:51,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909079343] [2022-11-20 11:57:51,656 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:57:51,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:51,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:51,658 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:51,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:57:51,856 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-20 11:57:51,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:57:51,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:57:51,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:57:51,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:57:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:57:52,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909079343] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:57:52,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:57:52,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-11-20 11:57:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118681528] [2022-11-20 11:57:52,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:57:52,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 11:57:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:52,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 11:57:52,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:57:52,020 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 11:57:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:52,331 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2022-11-20 11:57:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:57:52,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-11-20 11:57:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:52,333 INFO L225 Difference]: With dead ends: 140 [2022-11-20 11:57:52,333 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 11:57:52,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-11-20 11:57:52,335 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 88 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:52,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 163 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:57:52,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 11:57:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2022-11-20 11:57:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 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-20 11:57:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-11-20 11:57:52,359 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 46 [2022-11-20 11:57:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:52,359 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-11-20 11:57:52,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 11:57:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-11-20 11:57:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 11:57:52,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:52,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:52,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:52,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 11:57:52,567 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:52,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1865194857, now seen corresponding path program 2 times [2022-11-20 11:57:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:52,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632447741] [2022-11-20 11:57:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:52,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 11:57:52,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:52,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632447741] [2022-11-20 11:57:52,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632447741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:52,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410569852] [2022-11-20 11:57:52,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:57:52,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:52,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:52,788 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:52,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 11:57:53,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:57:53,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:57:53,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:57:53,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 11:57:53,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:57:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 11:57:53,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410569852] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:57:53,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:57:53,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-11-20 11:57:53,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125712234] [2022-11-20 11:57:53,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:57:53,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:57:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:53,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:57:53,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:57:53,179 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 11:57:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:53,331 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-11-20 11:57:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:57:53,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-11-20 11:57:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:53,333 INFO L225 Difference]: With dead ends: 69 [2022-11-20 11:57:53,333 INFO L226 Difference]: Without dead ends: 39 [2022-11-20 11:57:53,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:57:53,334 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:53,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 114 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:57:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-20 11:57:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-20 11:57:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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-20 11:57:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-11-20 11:57:53,343 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 47 [2022-11-20 11:57:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:53,344 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-11-20 11:57:53,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 11:57:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-11-20 11:57:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 11:57:53,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:53,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:57:53,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:53,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 11:57:53,552 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:57:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2056935971, now seen corresponding path program 6 times [2022-11-20 11:57:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:53,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290701417] [2022-11-20 11:57:53,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:53,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:53,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:57:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:53,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 11:57:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 11:57:53,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:53,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290701417] [2022-11-20 11:57:53,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290701417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:57:53,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366553573] [2022-11-20 11:57:53,703 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:57:53,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:53,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:57:53,705 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:57:53,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 11:57:54,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-20 11:57:54,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:57:54,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:57:54,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:57:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 11:57:54,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:57:54,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366553573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:54,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:57:54,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-20 11:57:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652889170] [2022-11-20 11:57:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:54,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:57:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:57:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:57:54,086 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:57:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:54,104 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-11-20 11:57:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:57:54,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-11-20 11:57:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:54,105 INFO L225 Difference]: With dead ends: 44 [2022-11-20 11:57:54,106 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 11:57:54,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:57:54,111 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:54,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:57:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 11:57:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 11:57:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:57:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 11:57:54,113 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-11-20 11:57:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:54,113 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:57:54,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 11:57:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 11:57:54,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 11:57:54,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 11:57:54,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 11:57:54,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:57:54,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 11:57:56,993 INFO L902 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2022-11-20 11:57:56,994 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|))) (let ((.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse6 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_~index#1|)) (.cse9 (= (select .cse12 |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse0 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse5 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (not (= (select .cse3 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse13 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and .cse0 .cse1 .cse2 (not (< 0 |ULTIMATE.start_sll_circular_update_at_~index#1|)) .cse4 .cse5 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse6 (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= (+ 1 (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_623) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse3 .cse11 v_ArrVal_622)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse12 .cse11 v_ArrVal_625)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) .cse13)) .cse7 .cse9 .cse10 (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= .cse13 (+ 1 (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_623) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse3 .cse11 v_ArrVal_622)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse12 .cse11 v_ArrVal_625)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))))))) (and (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) .cse0 .cse2 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse5 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse7 (not .cse1) .cse8 (<= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) .cse10)))) [2022-11-20 11:57:56,994 INFO L899 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2022-11-20 11:57:56,995 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 11:57:56,995 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 11:57:56,995 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2022-11-20 11:57:56,995 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-11-20 11:57:56,995 INFO L899 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2022-11-20 11:57:56,996 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse3 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse21 (select .cse3 4)) (.cse2 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse20 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (let ((.cse9 (= .cse20 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4))) (.cse0 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (.cse11 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse1 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse12 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse8 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse13 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse14 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse5 (= .cse2 (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|))) (.cse6 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse15 (<= .cse21 |ULTIMATE.start_main_~len~0#1|)) (.cse16 (<= .cse20 (+ .cse21 1))) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse17 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse19 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~len~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (= .cse2 (+ (select .cse3 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2)) .cse4 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse5 .cse6 .cse7 (= .cse8 2)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) (let ((.cse18 (select (select |#memory_int| .cse10) 4))) (and .cse9 (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| .cse10)) .cse11 .cse1 .cse12 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) .cse4 .cse13 .cse14 .cse5 .cse6 .cse15 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) .cse16 .cse7 .cse17 (<= .cse18 |ULTIMATE.start_main_~expected~0#1|) .cse19 (<= |ULTIMATE.start_main_~expected~0#1| .cse18)))) (and .cse9 .cse0 .cse11 .cse1 .cse12 (= .cse8 3) .cse4 .cse13 .cse14 .cse5 .cse6 .cse15 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) .cse16 .cse7 .cse17 .cse19))))) [2022-11-20 11:57:56,996 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-11-20 11:57:56,996 INFO L895 garLoopResultBuilder]: At program point L632(lines 620 639) the Hoare annotation is: false [2022-11-20 11:57:56,996 INFO L899 garLoopResultBuilder]: For program point L625-2(lines 625 628) no Hoare annotation was computed. [2022-11-20 11:57:56,997 INFO L895 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse8 (+ (select (select |#memory_int| .cse3) 4) 1)) (.cse7 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse5 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (= .cse12 0)) (.cse9 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse10 (<= .cse8 .cse7)) (.cse11 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_~index#1|)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| .cse3 v_ArrVal_618) |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) .cse4 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| .cse5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) .cse6) (and .cse0 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse1 (<= .cse7 .cse8) (= .cse7 (+ (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse2 (<= .cse5 0) (= .cse7 (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|)) .cse9 .cse10 .cse11 .cse4 .cse6) (and .cse0 .cse1 (= .cse3 |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not (= .cse3 |ULTIMATE.start_main_~s~0#1.base|)) (= .cse7 (+ |ULTIMATE.start_sll_circular_update_at_~data#1| 1)) .cse2 .cse9 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse10 .cse11 .cse4 (<= (+ .cse7 |ULTIMATE.start_main_~i~0#1|) .cse8) (= .cse12 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse6))))) [2022-11-20 11:57:56,997 INFO L899 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed. [2022-11-20 11:57:56,997 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)) [2022-11-20 11:57:56,997 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-11-20 11:57:56,998 INFO L895 garLoopResultBuilder]: At program point L593(lines 583 594) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) [2022-11-20 11:57:56,998 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 11:57:56,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2022-11-20 11:57:56,998 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) .cse0 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse1 (not .cse2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) (and .cse0 .cse2 .cse1 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)))) [2022-11-20 11:57:56,999 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2022-11-20 11:57:56,999 INFO L895 garLoopResultBuilder]: At program point L611(lines 606 612) the Hoare annotation is: (let ((.cse10 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse1 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse9 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse5 (= .cse10 (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|))) (.cse6 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (or (let ((.cse0 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse7 (select .cse9 4))) (and (= .cse0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) .cse1 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) .cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= .cse3 3) .cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= 3 |ULTIMATE.start_main_~expected~0#1|) .cse5 .cse6 (<= .cse7 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 3) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) (<= .cse0 (+ .cse7 1)) .cse8 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (and .cse1 (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2) .cse2 (= |ULTIMATE.start_main_~len~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (= .cse10 (+ (select .cse9 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2)) .cse4 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse5 .cse6 .cse8 (= .cse3 2))))) [2022-11-20 11:57:56,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 11:57:57,000 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-11-20 11:57:57,000 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)) [2022-11-20 11:57:57,000 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-11-20 11:57:57,000 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-11-20 11:57:57,000 INFO L899 garLoopResultBuilder]: For program point L629-2(lines 629 634) no Hoare annotation was computed. [2022-11-20 11:57:57,001 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse10 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse7 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (.cse1 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse8 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse3 (= .cse10 (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|))) (.cse4 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse0 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse5 (select .cse8 4))) (and (= .cse0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) .cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse3 .cse4 (<= .cse5 |ULTIMATE.start_main_~len~0#1|) (<= .cse0 (+ .cse5 1)) .cse6 (= |ULTIMATE.start_main_~len~0#1| .cse7) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (and .cse9 (<= .cse7 0) .cse4 .cse6) (and .cse9 .cse1 (= |ULTIMATE.start_main_~len~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (= .cse10 (+ (select .cse8 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2)) .cse2 .cse3 .cse4 .cse6)))) [2022-11-20 11:57:57,001 INFO L899 garLoopResultBuilder]: For program point L629-4(lines 629 634) no Hoare annotation was computed. [2022-11-20 11:57:57,001 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 619) no Hoare annotation was computed. [2022-11-20 11:57:57,002 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-11-20 11:57:57,002 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-11-20 11:57:57,002 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-20 11:57:57,002 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-11-20 11:57:57,002 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2022-11-20 11:57:57,003 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-11-20 11:57:57,007 INFO L444 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1] [2022-11-20 11:57:57,009 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:57:57,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,034 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,036 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,055 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,059 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,064 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,066 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,067 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,067 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] [2022-11-20 11:57:57,068 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,072 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,072 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,072 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,073 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] [2022-11-20 11:57:57,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,074 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] [2022-11-20 11:57:57,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,075 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,076 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] [2022-11-20 11:57:57,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,079 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,084 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] [2022-11-20 11:57:57,085 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,085 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,085 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,086 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,086 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,086 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] [2022-11-20 11:57:57,087 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,087 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] [2022-11-20 11:57:57,093 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,094 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,095 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,095 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] [2022-11-20 11:57:57,095 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,096 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,098 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,098 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,100 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,101 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 11:57:57,101 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,101 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_618,QUANTIFIED] [2022-11-20 11:57:57,102 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,102 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 11:57:57,110 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,110 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,110 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,111 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,111 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,111 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,112 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,112 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,112 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,113 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,113 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,114 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,115 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 11:57:57,116 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,116 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_618,QUANTIFIED] [2022-11-20 11:57:57,116 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,117 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,118 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 11:57:57,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,120 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,120 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,124 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,129 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,129 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,129 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,131 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:57:57 BoogieIcfgContainer [2022-11-20 11:57:57,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:57:57,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:57:57,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:57:57,150 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:57:57,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:57:25" (3/4) ... [2022-11-20 11:57:57,154 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 11:57:57,162 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-20 11:57:57,171 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-20 11:57:57,172 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 11:57:57,172 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 11:57:57,172 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 11:57:57,210 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((last == #memory_$Pointer$[head][head] && \result == 0) && head == 0) && #memory_$Pointer$[\result][\result] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len == 2) && !(head == last)) && #memory_$Pointer$[head][head] == 0 [2022-11-20 11:57:57,211 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((last == #memory_$Pointer$[head][head] && \result == 0) && head == 0) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[\result][\result] == 0) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 : int :: v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 < s || (forall v_ArrVal_618 : [int]int, v_ArrVal_622 : int :: !(#memory_$Pointer$[#memory_$Pointer$[s][s] := v_ArrVal_618][s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := v_ArrVal_622][s] == s)))) && !(#memory_$Pointer$[\result][\result] == \result)) && len == 2) && !(head == last)) && len == i + 1) && #memory_$Pointer$[head][head] == 0) && s == 0) || (((((((((((((\result == 0 && head == s) && head == 0) && len * 2 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && s == head) && #memory_$Pointer$[s][s] == 0) && i + 1 <= 0) && len * 2 == 2 + data) && index <= 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1 <= len * 2) && i <= index) && len == 2) && s == 0)) || (((((((((((((\result == 0 && head == 0) && #memory_$Pointer$[s][s] == head) && !(#memory_$Pointer$[s][s] == s)) && len * 2 == data + 1) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1 <= len * 2) && i <= index) && len == 2) && len * 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1) && #memory_$Pointer$[s][s] == head) && s == 0) [2022-11-20 11:57:57,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((len + i == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] && \result == 0) && head == s) && head == 0) && s == head) && #memory_$Pointer$[s][s] == 0) && len * 2 == 2 + data) && index <= 0) && unknown-#memory_int-unknown[s][4] <= len) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && len == 2) && len == i + 1) && s == 0) || (((index <= 0 && i + 1 <= 0) && index <= 0) && len == 2)) || (((((((index <= 0 && head == s) && len == 2 + i) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && s == head) && len * 2 == 2 + data) && index <= 0) && len == 2) [2022-11-20 11:57:57,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 0 && head == s) && head == 0) && !(#memory_$Pointer$[head][head] == s)) && index <= 1) && s == head) && len + i == data) && i <= index) && len == 2) && len == i + 1) && #memory_$Pointer$[head][s] == 0) && s == 0) || ((((((((((((\result == 0 && head == s) && head == 0) && !(0 < index)) && s == head) && len + i == data) && 0 <= i) && i <= index) && (forall v_ArrVal_623 : [int]int, v_ArrVal_625 : int, v_ArrVal_622 : int :: 1 + unknown-#memory_int-unknown[head := v_ArrVal_623][#memory_$Pointer$[head := #memory_$Pointer$[head][4 + head := v_ArrVal_622]][s][s]][#memory_$Pointer$[head := #memory_$Pointer$[head][4 + head := v_ArrVal_625]][s][s] + 4] <= len * 2)) && len == 2) && #memory_$Pointer$[head][s] == 0) && s == 0) && (forall v_ArrVal_623 : [int]int, v_ArrVal_625 : int, v_ArrVal_622 : int :: len * 2 <= 1 + unknown-#memory_int-unknown[head := v_ArrVal_623][#memory_$Pointer$[head := #memory_$Pointer$[head][4 + head := v_ArrVal_622]][s][s]][#memory_$Pointer$[head := #memory_$Pointer$[head][4 + head := v_ArrVal_625]][s][s] + 4]))) || (((((((((((head == 0 && \result == 0) && head == 0) && #memory_$Pointer$[s][s] == head) && #memory_$Pointer$[s][s] == 0) && len + i == data) && index <= 0) && len == 2) && !(head == s)) && len == i + 1) && i <= index + 1) && s == 0) [2022-11-20 11:57:57,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((index <= 0 && head == s) && len == 2 + i) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && s == head) && 2 == expected) && len * 2 == 2 + data) && index <= 0) && len == 2) && unknown-#memory_int-unknown[head][head + 4] == 2) || (((((((((((((((((((((len + i == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] && head <= 0) && #memory_$Pointer$[head][head] == 0) && !(head == #memory_$Pointer$[head][head])) && \result == 0) && head == s) && head == 0) && 0 <= head) && 1 <= index) && s == head) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && len * 2 == 2 + data) && index <= 0) && unknown-#memory_int-unknown[s][4] <= len) && index <= 1) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && len == 2) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4] <= expected) && s == 0) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4])) || ((((((((((((((((len + i == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] && index <= 0) && \result == 0) && head == s) && head == 0) && unknown-#memory_int-unknown[head][head + 4] == 3) && s == head) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && len * 2 == 2 + data) && index <= 0) && unknown-#memory_int-unknown[s][4] <= len) && head == 0) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && len == 2) && len == i + 1) && s == 0) [2022-11-20 11:57:57,213 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((len + i == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] && index <= 0) && \result == 0) && head == s) && head == 0) && unknown-#memory_int-unknown[head][head + 4] == 3) && s == head) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && len * 2 == 2 + data) && index <= 0) && unknown-#memory_int-unknown[s][4] <= len) && \result == 3) && head == 0) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && len == 2) && len == i + 1) && s == 0) || ((((((((((index <= 0 && \result == 2) && head == s) && len == 2 + i) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && s == head) && 2 == expected) && len * 2 == 2 + data) && index <= 0) && len == 2) && unknown-#memory_int-unknown[head][head + 4] == 2) [2022-11-20 11:57:57,231 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:57:57,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:57:57,232 INFO L158 Benchmark]: Toolchain (without parser) took 32726.74ms. Allocated memory was 157.3MB in the beginning and 427.8MB in the end (delta: 270.5MB). Free memory was 112.9MB in the beginning and 325.0MB in the end (delta: -212.0MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2022-11-20 11:57:57,233 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 157.3MB. Free memory was 101.0MB in the beginning and 100.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:57:57,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.37ms. Allocated memory is still 157.3MB. Free memory was 112.9MB in the beginning and 95.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 11:57:57,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.83ms. Allocated memory is still 157.3MB. Free memory was 95.4MB in the beginning and 93.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:57:57,235 INFO L158 Benchmark]: Boogie Preprocessor took 66.46ms. Allocated memory is still 157.3MB. Free memory was 93.4MB in the beginning and 91.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:57:57,235 INFO L158 Benchmark]: RCFGBuilder took 702.34ms. Allocated memory is still 157.3MB. Free memory was 91.3MB in the beginning and 76.0MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 11:57:57,235 INFO L158 Benchmark]: TraceAbstraction took 31347.81ms. Allocated memory was 157.3MB in the beginning and 427.8MB in the end (delta: 270.5MB). Free memory was 75.8MB in the beginning and 328.1MB in the end (delta: -252.3MB). Peak memory consumption was 160.8MB. Max. memory is 16.1GB. [2022-11-20 11:57:57,239 INFO L158 Benchmark]: Witness Printer took 82.44ms. Allocated memory is still 427.8MB. Free memory was 328.1MB in the beginning and 325.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:57:57,246 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 157.3MB. Free memory was 101.0MB in the beginning and 100.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.37ms. Allocated memory is still 157.3MB. Free memory was 112.9MB in the beginning and 95.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.83ms. Allocated memory is still 157.3MB. Free memory was 95.4MB in the beginning and 93.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.46ms. Allocated memory is still 157.3MB. Free memory was 93.4MB in the beginning and 91.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 702.34ms. Allocated memory is still 157.3MB. Free memory was 91.3MB in the beginning and 76.0MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31347.81ms. Allocated memory was 157.3MB in the beginning and 427.8MB in the end (delta: 270.5MB). Free memory was 75.8MB in the beginning and 328.1MB in the end (delta: -252.3MB). Peak memory consumption was 160.8MB. Max. memory is 16.1GB. * Witness Printer took 82.44ms. Allocated memory is still 427.8MB. Free memory was 328.1MB in the beginning and 325.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_618,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_618,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 637]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.1s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1236 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1230 mSDsluCounter, 2328 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 347 IncrementalHoareTripleChecker+Unchecked, 1951 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2263 IncrementalHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 377 mSDtfsCounter, 2263 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 703 SyntacticMatches, 19 SemanticMatches, 227 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=11, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 150 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 40 NumberOfFragments, 1178 HoareAnnotationTreeSize, 18 FomulaSimplifications, 8916 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 14 FomulaSimplificationsInter, 2829 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 967 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1230 ConstructedInterpolants, 13 QuantifiedInterpolants, 6682 SizeOfPredicates, 83 NumberOfNonLiveVariables, 3415 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 32 InterpolantComputations, 9 PerfectInterpolantSequences, 444/556 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant [2022-11-20 11:57:57,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,274 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,274 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((len + i == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] && index <= 0) && \result == 0) && head == s) && head == 0) && unknown-#memory_int-unknown[head][head + 4] == 3) && s == head) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && len * 2 == 2 + data) && index <= 0) && unknown-#memory_int-unknown[s][4] <= len) && \result == 3) && head == 0) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && len == 2) && len == i + 1) && s == 0) || ((((((((((index <= 0 && \result == 2) && head == s) && len == 2 + i) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && s == head) && 2 == expected) && len * 2 == 2 + data) && index <= 0) && len == 2) && unknown-#memory_int-unknown[head][head + 4] == 2) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2022-11-20 11:57:57,276 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,276 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((last == #memory_$Pointer$[head][head] && head == 0) && len <= 1) && len == 2) && !(head == last)) && #memory_$Pointer$[head][head] == 0) || ((((head == 0 && head == last) && len == 2) && \valid[last] == 1) && len == len) - InvariantResult [Line: 629]: Loop Invariant [2022-11-20 11:57:57,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((len + i == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] && \result == 0) && head == s) && head == 0) && s == head) && #memory_$Pointer$[s][s] == 0) && len * 2 == 2 + data) && index <= 0) && unknown-#memory_int-unknown[s][4] <= len) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && len == 2) && len == i + 1) && s == 0) || (((index <= 0 && i + 1 <= 0) && index <= 0) && len == 2)) || (((((((index <= 0 && head == s) && len == 2 + i) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && s == head) && len * 2 == 2 + data) && index <= 0) && len == 2) - InvariantResult [Line: 614]: Loop Invariant [2022-11-20 11:57:57,280 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,280 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,280 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] [2022-11-20 11:57:57,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,281 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,282 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] [2022-11-20 11:57:57,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,283 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] [2022-11-20 11:57:57,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,283 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,284 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] [2022-11-20 11:57:57,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,287 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] [2022-11-20 11:57:57,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,287 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,288 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,288 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] [2022-11-20 11:57:57,288 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,288 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_623,QUANTIFIED] [2022-11-20 11:57:57,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,289 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,290 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_625,QUANTIFIED] [2022-11-20 11:57:57,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((\result == 0 && head == s) && head == 0) && !(#memory_$Pointer$[head][head] == s)) && index <= 1) && s == head) && len + i == data) && i <= index) && len == 2) && len == i + 1) && #memory_$Pointer$[head][s] == 0) && s == 0) || ((((((((((((\result == 0 && head == s) && head == 0) && !(0 < index)) && s == head) && len + i == data) && 0 <= i) && i <= index) && (forall v_ArrVal_623 : [int]int, v_ArrVal_625 : int, v_ArrVal_622 : int :: 1 + unknown-#memory_int-unknown[head := v_ArrVal_623][#memory_$Pointer$[head := #memory_$Pointer$[head][4 + head := v_ArrVal_622]][s][s]][#memory_$Pointer$[head := #memory_$Pointer$[head][4 + head := v_ArrVal_625]][s][s] + 4] <= len * 2)) && len == 2) && #memory_$Pointer$[head][s] == 0) && s == 0) && (forall v_ArrVal_623 : [int]int, v_ArrVal_625 : int, v_ArrVal_622 : int :: len * 2 <= 1 + unknown-#memory_int-unknown[head := v_ArrVal_623][#memory_$Pointer$[head := #memory_$Pointer$[head][4 + head := v_ArrVal_622]][s][s]][#memory_$Pointer$[head := #memory_$Pointer$[head][4 + head := v_ArrVal_625]][s][s] + 4]))) || (((((((((((head == 0 && \result == 0) && head == 0) && #memory_$Pointer$[s][s] == head) && #memory_$Pointer$[s][s] == 0) && len + i == data) && index <= 0) && len == 2) && !(head == s)) && len == i + 1) && i <= index + 1) && s == 0) - InvariantResult [Line: 625]: Loop Invariant [2022-11-20 11:57:57,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,292 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 11:57:57,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_618,QUANTIFIED] [2022-11-20 11:57:57,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 11:57:57,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,299 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 11:57:57,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,299 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_618,QUANTIFIED] [2022-11-20 11:57:57,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,300 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_622,QUANTIFIED] [2022-11-20 11:57:57,300 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2022-11-20 11:57:57,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((last == #memory_$Pointer$[head][head] && \result == 0) && head == 0) && #memory_$Pointer$[s][s] == 0) && #memory_$Pointer$[\result][\result] == 0) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 : int :: v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 < s || (forall v_ArrVal_618 : [int]int, v_ArrVal_622 : int :: !(#memory_$Pointer$[#memory_$Pointer$[s][s] := v_ArrVal_618][s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := v_ArrVal_622][s] == s)))) && !(#memory_$Pointer$[\result][\result] == \result)) && len == 2) && !(head == last)) && len == i + 1) && #memory_$Pointer$[head][head] == 0) && s == 0) || (((((((((((((\result == 0 && head == s) && head == 0) && len * 2 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && s == head) && #memory_$Pointer$[s][s] == 0) && i + 1 <= 0) && len * 2 == 2 + data) && index <= 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1 <= len * 2) && i <= index) && len == 2) && s == 0)) || (((((((((((((\result == 0 && head == 0) && #memory_$Pointer$[s][s] == head) && !(#memory_$Pointer$[s][s] == s)) && len * 2 == data + 1) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1 <= len * 2) && i <= index) && len == 2) && len * 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1) && #memory_$Pointer$[s][s] == head) && s == 0) - InvariantResult [Line: 583]: Loop Invariant [2022-11-20 11:57:57,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((last == #memory_$Pointer$[head][head] && \result == 0) && head == 0) && #memory_$Pointer$[\result][\result] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len == 2) && !(head == last)) && #memory_$Pointer$[head][head] == 0 - InvariantResult [Line: 607]: Loop Invariant [2022-11-20 11:57:57,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 11:57:57,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 11:57:57,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((index <= 0 && head == s) && len == 2 + i) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && s == head) && 2 == expected) && len * 2 == 2 + data) && index <= 0) && len == 2) && unknown-#memory_int-unknown[head][head + 4] == 2) || (((((((((((((((((((((len + i == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] && head <= 0) && #memory_$Pointer$[head][head] == 0) && !(head == #memory_$Pointer$[head][head])) && \result == 0) && head == s) && head == 0) && 0 <= head) && 1 <= index) && s == head) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && len * 2 == 2 + data) && index <= 0) && unknown-#memory_int-unknown[s][4] <= len) && index <= 1) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && len == 2) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4] <= expected) && s == 0) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4])) || ((((((((((((((((len + i == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] && index <= 0) && \result == 0) && head == s) && head == 0) && unknown-#memory_int-unknown[head][head + 4] == 3) && s == head) && #memory_$Pointer$[s][s] == 0) && 3 == expected) && len * 2 == 2 + data) && index <= 0) && unknown-#memory_int-unknown[s][4] <= len) && head == 0) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && len == 2) && len == i + 1) && s == 0) RESULT: Ultimate proved your program to be correct! [2022-11-20 11:57:57,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b305084e-20ea-4d96-bf4c-7ce6f5615913/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE