./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS --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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- 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-4e7fbc6 [2022-11-23 03:55:46,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:55:46,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:55:46,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:55:46,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:55:46,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:55:46,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:55:46,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:55:46,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:55:46,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:55:46,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:55:46,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:55:46,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:55:46,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:55:46,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:55:46,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:55:46,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:55:46,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:55:46,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:55:46,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:55:46,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:55:46,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:55:46,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:55:46,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:55:46,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:55:46,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:55:46,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:55:46,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:55:46,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:55:46,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:55:46,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:55:46,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:55:46,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:55:46,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:55:46,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:55:46,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:55:46,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:55:46,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:55:46,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:55:46,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:55:46,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:55:46,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:55:46,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:55:47,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:55:47,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:55:47,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:55:47,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:55:47,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:55:47,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:55:47,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:55:47,003 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:55:47,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:55:47,003 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:55:47,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:55:47,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:55:47,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:55:47,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:55:47,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:55:47,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:55:47,005 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:55:47,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:55:47,006 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:55:47,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:55:47,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:55:47,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:55:47,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:55:47,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:55:47,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:55:47,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:55:47,008 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:55:47,008 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:55:47,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:55:47,009 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:55:47,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:55:47,009 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:55:47,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:55:47,010 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/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_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-11-23 03:55:47,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:55:47,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:55:47,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:55:47,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:55:47,335 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:55:47,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/heap-manipulation/dancing.i [2022-11-23 03:55:50,640 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:55:50,947 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:55:50,949 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/sv-benchmarks/c/heap-manipulation/dancing.i [2022-11-23 03:55:50,958 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/data/2b1649f77/1e2ad4bfaf1d4bd0bbf015364a805283/FLAGfef18cc00 [2022-11-23 03:55:50,977 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/data/2b1649f77/1e2ad4bfaf1d4bd0bbf015364a805283 [2022-11-23 03:55:50,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:55:50,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:55:50,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:55:50,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:55:50,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:55:50,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:50" (1/1) ... [2022-11-23 03:55:50,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43705639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:50, skipping insertion in model container [2022-11-23 03:55:50,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:55:50" (1/1) ... [2022-11-23 03:55:51,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:55:51,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:55:51,200 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_f07bd341-a28b-43f3-a919-64bac5ba15b2/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-11-23 03:55:51,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:55:51,351 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:55:51,375 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_f07bd341-a28b-43f3-a919-64bac5ba15b2/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-11-23 03:55:51,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:55:51,475 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:55:51,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51 WrapperNode [2022-11-23 03:55:51,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:55:51,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:55:51,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:55:51,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:55:51,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,558 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-11-23 03:55:51,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:55:51,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:55:51,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:55:51,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:55:51,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,616 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:55:51,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:55:51,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:55:51,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:55:51,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (1/1) ... [2022-11-23 03:55:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:55:51,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:55:51,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:55:51,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:55:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-11-23 03:55:51,710 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-11-23 03:55:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 03:55:51,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 03:55:51,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 03:55:51,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:55:51,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:55:51,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 03:55:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 03:55:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:55:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:55:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:55:51,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:55:51,915 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:55:51,931 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:55:52,295 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:55:52,303 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:55:52,303 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 03:55:52,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:52 BoogieIcfgContainer [2022-11-23 03:55:52,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:55:52,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:55:52,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:55:52,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:55:52,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:55:50" (1/3) ... [2022-11-23 03:55:52,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c10b022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:52, skipping insertion in model container [2022-11-23 03:55:52,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:55:51" (2/3) ... [2022-11-23 03:55:52,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c10b022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:55:52, skipping insertion in model container [2022-11-23 03:55:52,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:52" (3/3) ... [2022-11-23 03:55:52,315 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-11-23 03:55:52,337 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:55:52,338 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 03:55:52,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:55:52,417 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;@6534db5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:55:52,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 03:55:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 03:55:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 03:55:52,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:52,433 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-23 03:55:52,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:55:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:52,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2022-11-23 03:55:52,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:52,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020126603] [2022-11-23 03:55:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:52,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:52,660 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-23 03:55:52,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:52,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020126603] [2022-11-23 03:55:52,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020126603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:55:52,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:55:52,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:55:52,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826220931] [2022-11-23 03:55:52,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:55:52,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 03:55:52,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:52,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 03:55:52,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:55:52,708 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:55:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:52,736 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-11-23 03:55:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 03:55:52,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-23 03:55:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:52,749 INFO L225 Difference]: With dead ends: 77 [2022-11-23 03:55:52,749 INFO L226 Difference]: Without dead ends: 37 [2022-11-23 03:55:52,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:55:52,757 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:52,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:55:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-23 03:55:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-23 03:55:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 03:55:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-11-23 03:55:52,804 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2022-11-23 03:55:52,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:52,805 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-11-23 03:55:52,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:55:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-11-23 03:55:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 03:55:52,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:52,809 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-23 03:55:52,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:55:52,809 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:55:52,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:52,811 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2022-11-23 03:55:52,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:52,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484031280] [2022-11-23 03:55:52,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:52,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:53,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:53,074 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-23 03:55:53,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:53,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484031280] [2022-11-23 03:55:53,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484031280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:55:53,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:55:53,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:55:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114153330] [2022-11-23 03:55:53,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:55:53,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:55:53,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:53,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:55:53,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:55:53,079 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:55:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:53,134 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-11-23 03:55:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:55:53,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-23 03:55:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:53,142 INFO L225 Difference]: With dead ends: 45 [2022-11-23 03:55:53,143 INFO L226 Difference]: Without dead ends: 43 [2022-11-23 03:55:53,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-23 03:55:53,149 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:53,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:55:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-23 03:55:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-11-23 03:55:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 03:55:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-11-23 03:55:53,159 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2022-11-23 03:55:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:53,161 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-11-23 03:55:53,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:55:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-11-23 03:55:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 03:55:53,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:53,163 INFO L195 NwaCegarLoop]: trace histogram [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-23 03:55:53,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:55:53,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:55:53,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:53,164 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2022-11-23 03:55:53,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:53,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810139133] [2022-11-23 03:55:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:53,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:53,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:55:53,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:53,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810139133] [2022-11-23 03:55:53,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810139133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:55:53,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:55:53,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:55:53,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128751710] [2022-11-23 03:55:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:55:53,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:55:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:53,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:55:53,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:55:53,422 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:55:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:53,476 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2022-11-23 03:55:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:55:53,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-23 03:55:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:53,478 INFO L225 Difference]: With dead ends: 86 [2022-11-23 03:55:53,478 INFO L226 Difference]: Without dead ends: 63 [2022-11-23 03:55:53,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:55:53,480 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:53,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:55:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-23 03:55:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-11-23 03:55:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 44 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-23 03:55:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-11-23 03:55:53,491 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2022-11-23 03:55:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:53,491 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-11-23 03:55:53,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:55:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-11-23 03:55:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 03:55:53,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:53,493 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:55:53,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:55:53,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:55:53,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:53,495 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2022-11-23 03:55:53,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:53,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266642579] [2022-11-23 03:55:53,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:53,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:53,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:55:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:55:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:55:53,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:53,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266642579] [2022-11-23 03:55:53,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266642579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:53,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277249100] [2022-11-23 03:55:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:53,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:53,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:55:53,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:55:53,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:55:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:54,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 03:55:54,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:55:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:55:54,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:55:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:55:54,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277249100] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:55:54,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:55:54,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-23 03:55:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437693240] [2022-11-23 03:55:54,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:55:54,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 03:55:54,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:54,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 03:55:54,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-23 03:55:54,565 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-23 03:55:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:54,968 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2022-11-23 03:55:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:55:54,969 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-11-23 03:55:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:54,977 INFO L225 Difference]: With dead ends: 118 [2022-11-23 03:55:54,977 INFO L226 Difference]: Without dead ends: 82 [2022-11-23 03:55:54,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-11-23 03:55:54,983 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 134 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:54,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 338 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:55:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-23 03:55:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2022-11-23 03:55:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 52 states have internal predecessors, (66), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-23 03:55:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-11-23 03:55:55,002 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2022-11-23 03:55:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:55,003 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-11-23 03:55:55,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-23 03:55:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-11-23 03:55:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 03:55:55,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:55,005 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] [2022-11-23 03:55:55,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 03:55:55,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:55,211 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:55:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2022-11-23 03:55:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:55,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659855558] [2022-11-23 03:55:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:55,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:55:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:55,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-23 03:55:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:55:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:55,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659855558] [2022-11-23 03:55:55,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659855558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:55:55,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:55:55,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:55:55,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420409733] [2022-11-23 03:55:55,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:55:55,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:55:55,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:55,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:55:55,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:55:55,498 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:55:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:55,594 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2022-11-23 03:55:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:55:55,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-11-23 03:55:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:55,596 INFO L225 Difference]: With dead ends: 75 [2022-11-23 03:55:55,597 INFO L226 Difference]: Without dead ends: 73 [2022-11-23 03:55:55,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:55:55,601 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:55,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 289 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:55:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-23 03:55:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-11-23 03:55:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 58 states have internal predecessors, (71), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2022-11-23 03:55:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2022-11-23 03:55:55,630 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2022-11-23 03:55:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:55,631 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2022-11-23 03:55:55,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 03:55:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-11-23 03:55:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 03:55:55,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:55,636 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2022-11-23 03:55:55,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:55:55,637 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:55:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2022-11-23 03:55:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:55,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712021875] [2022-11-23 03:55:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:55,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:55:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:55,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-23 03:55:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:55,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 03:55:55,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:55,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712021875] [2022-11-23 03:55:55,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712021875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:55:55,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468362347] [2022-11-23 03:55:55,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:55,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:55:55,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:55:55,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:55:55,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:55:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:55,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-23 03:55:55,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:55:56,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:55:56,074 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:55:56,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:55:56,089 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:55:56,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:55:56,100 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 16 treesize of output 18 [2022-11-23 03:55:56,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:55:56,111 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 16 treesize of output 18 [2022-11-23 03:55:56,315 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-23 03:55:56,321 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-23 03:55:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:55:56,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:55:56,415 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 10 treesize of output 4 [2022-11-23 03:55:56,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:55:56,570 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 2 case distinctions, treesize of input 25 treesize of output 31 [2022-11-23 03:55:56,576 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 36 treesize of output 24 [2022-11-23 03:55:56,581 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 3 [2022-11-23 03:55:56,590 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-23 03:55:56,591 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-11-23 03:55:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 03:55:56,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468362347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:55:56,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:55:56,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2022-11-23 03:55:56,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426315308] [2022-11-23 03:55:56,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:55:56,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 03:55:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 03:55:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-23 03:55:56,630 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 03:55:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:58,044 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2022-11-23 03:55:58,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 03:55:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 37 [2022-11-23 03:55:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:58,048 INFO L225 Difference]: With dead ends: 326 [2022-11-23 03:55:58,048 INFO L226 Difference]: Without dead ends: 253 [2022-11-23 03:55:58,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 03:55:58,050 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 247 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:58,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 852 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 03:55:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-23 03:55:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 136. [2022-11-23 03:55:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.316831683168317) internal successors, (133), 111 states have internal predecessors, (133), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (34), 16 states have call predecessors, (34), 20 states have call successors, (34) [2022-11-23 03:55:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2022-11-23 03:55:58,105 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 37 [2022-11-23 03:55:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:58,106 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2022-11-23 03:55:58,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 03:55:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2022-11-23 03:55:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 03:55:58,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:58,108 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, 1] [2022-11-23 03:55:58,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:55:58,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-23 03:55:58,309 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:55:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:58,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2022-11-23 03:55:58,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:58,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239309637] [2022-11-23 03:55:58,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:58,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:58,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:58,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:55:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:55:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:58,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239309637] [2022-11-23 03:55:58,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239309637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:55:58,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:55:58,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:55:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543012994] [2022-11-23 03:55:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:55:58,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:55:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:58,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:55:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:55:58,613 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 03:55:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:58,754 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2022-11-23 03:55:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:55:58,755 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-11-23 03:55:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:58,757 INFO L225 Difference]: With dead ends: 179 [2022-11-23 03:55:58,757 INFO L226 Difference]: Without dead ends: 148 [2022-11-23 03:55:58,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:55:58,758 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:58,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 165 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:55:58,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-23 03:55:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2022-11-23 03:55:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 113 states have internal predecessors, (135), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (34), 16 states have call predecessors, (34), 20 states have call successors, (34) [2022-11-23 03:55:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2022-11-23 03:55:58,803 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 35 [2022-11-23 03:55:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:58,804 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2022-11-23 03:55:58,804 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 03:55:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2022-11-23 03:55:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 03:55:58,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:58,811 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, 1] [2022-11-23 03:55:58,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:55:58,812 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:55:58,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:58,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2022-11-23 03:55:58,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:58,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140005689] [2022-11-23 03:55:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:58,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:55:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 03:55:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:58,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140005689] [2022-11-23 03:55:58,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140005689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:55:58,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:55:58,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:55:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82590737] [2022-11-23 03:55:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:55:58,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:55:58,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:55:58,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:55:58,953 INFO L87 Difference]: Start difference. First operand 138 states and 191 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 03:55:59,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:59,014 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2022-11-23 03:55:59,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:55:59,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-11-23 03:55:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:59,018 INFO L225 Difference]: With dead ends: 150 [2022-11-23 03:55:59,018 INFO L226 Difference]: Without dead ends: 138 [2022-11-23 03:55:59,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:55:59,020 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:59,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:55:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-23 03:55:59,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2022-11-23 03:55:59,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 93 states have internal predecessors, (115), 16 states have call successors, (16), 6 states have call predecessors, (16), 10 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2022-11-23 03:55:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2022-11-23 03:55:59,050 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 35 [2022-11-23 03:55:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:59,051 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2022-11-23 03:55:59,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 03:55:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2022-11-23 03:55:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 03:55:59,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:59,054 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-11-23 03:55:59,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:55:59,054 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:55:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:59,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2022-11-23 03:55:59,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:59,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228818478] [2022-11-23 03:55:59,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:59,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:59,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:55:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:59,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:55:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:59,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:55:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:55:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:55:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:55:59,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228818478] [2022-11-23 03:55:59,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228818478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:55:59,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:55:59,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:55:59,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240781241] [2022-11-23 03:55:59,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:55:59,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:55:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:55:59,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:55:59,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:55:59,279 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 03:55:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:55:59,382 INFO L93 Difference]: Finished difference Result 202 states and 267 transitions. [2022-11-23 03:55:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:55:59,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-11-23 03:55:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:55:59,384 INFO L225 Difference]: With dead ends: 202 [2022-11-23 03:55:59,384 INFO L226 Difference]: Without dead ends: 94 [2022-11-23 03:55:59,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-23 03:55:59,385 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:55:59,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:55:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-23 03:55:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-11-23 03:55:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 73 states have internal predecessors, (88), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2022-11-23 03:55:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2022-11-23 03:55:59,401 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 36 [2022-11-23 03:55:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:55:59,401 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2022-11-23 03:55:59,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 03:55:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2022-11-23 03:55:59,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 03:55:59,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:55:59,403 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-23 03:55:59,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:55:59,403 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:55:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:55:59,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1426728412, now seen corresponding path program 1 times [2022-11-23 03:55:59,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:55:59,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612823387] [2022-11-23 03:55:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:55:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:55:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:00,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:56:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:00,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:00,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-23 03:56:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:00,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-23 03:56:00,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:00,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612823387] [2022-11-23 03:56:00,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612823387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:56:00,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306774322] [2022-11-23 03:56:00,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:00,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:56:00,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:56:00,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:56:00,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:56:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:00,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-23 03:56:00,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:56:00,219 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-23 03:56:00,289 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:56:00,290 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-23 03:56:00,357 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-23 03:56:00,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-23 03:56:00,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-23 03:56:00,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-23 03:56:00,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:56:00,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:56:00,435 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 63 treesize of output 13 [2022-11-23 03:56:00,439 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 13 treesize of output 9 [2022-11-23 03:56:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:56:00,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:56:00,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:56:00,884 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 124 treesize of output 127 [2022-11-23 03:56:00,893 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 136 treesize of output 128 [2022-11-23 03:56:00,900 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 128 treesize of output 124 [2022-11-23 03:56:00,978 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 22 treesize of output 18 [2022-11-23 03:56:01,002 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 8 treesize of output 4 [2022-11-23 03:56:01,009 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-23 03:56:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 03:56:01,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306774322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:56:01,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:56:01,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 25 [2022-11-23 03:56:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677500221] [2022-11-23 03:56:01,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:56:01,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 03:56:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:01,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 03:56:01,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-11-23 03:56:01,202 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 25 states, 23 states have (on average 2.782608695652174) internal successors, (64), 25 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-23 03:56:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:56:02,627 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2022-11-23 03:56:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 03:56:02,628 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.782608695652174) internal successors, (64), 25 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 46 [2022-11-23 03:56:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:56:02,629 INFO L225 Difference]: With dead ends: 185 [2022-11-23 03:56:02,629 INFO L226 Difference]: Without dead ends: 109 [2022-11-23 03:56:02,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=448, Invalid=1808, Unknown=0, NotChecked=0, Total=2256 [2022-11-23 03:56:02,632 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 284 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:56:02,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 440 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 03:56:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-23 03:56:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-11-23 03:56:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 57 states have internal predecessors, (67), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-23 03:56:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2022-11-23 03:56:02,658 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 46 [2022-11-23 03:56:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:56:02,658 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2022-11-23 03:56:02,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.782608695652174) internal successors, (64), 25 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-23 03:56:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-11-23 03:56:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-23 03:56:02,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:56:02,660 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:02,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 03:56:02,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:56:02,866 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:56:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash 803799756, now seen corresponding path program 1 times [2022-11-23 03:56:02,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:02,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491407113] [2022-11-23 03:56:02,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:02,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:56:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:03,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:56:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:03,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 03:56:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:03,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491407113] [2022-11-23 03:56:03,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491407113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:56:03,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206765274] [2022-11-23 03:56:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:03,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:56:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:56:03,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:56:03,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:56:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:03,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-23 03:56:03,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:56:04,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:04,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:56:04,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:04,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:56:04,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:04,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:56:04,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:04,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:56:04,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:04,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:56:04,721 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 03:56:04,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2022-11-23 03:56:04,729 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 31 treesize of output 23 [2022-11-23 03:56:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 03:56:05,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:56:05,566 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 10 treesize of output 4 [2022-11-23 03:56:05,884 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 10 treesize of output 4 [2022-11-23 03:56:06,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:56:06,255 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 140 [2022-11-23 03:56:06,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:56:06,271 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 88 [2022-11-23 03:56:06,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:56:06,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 539 treesize of output 539 [2022-11-23 03:56:06,338 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 663 treesize of output 627 [2022-11-23 03:56:06,363 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 622 treesize of output 606 [2022-11-23 03:56:06,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:56:06,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 737 treesize of output 645 [2022-11-23 03:56:07,494 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 8 treesize of output 4 [2022-11-23 03:56:07,504 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 8 treesize of output 4 [2022-11-23 03:56:07,518 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 8 treesize of output 4 [2022-11-23 03:56:07,529 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 8 treesize of output 4 [2022-11-23 03:56:07,567 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 8 treesize of output 4 [2022-11-23 03:56:07,587 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 8 treesize of output 4 [2022-11-23 03:56:07,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:56:07,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 126 [2022-11-23 03:56:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 03:56:08,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206765274] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:56:08,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:56:08,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2022-11-23 03:56:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659066056] [2022-11-23 03:56:08,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:56:08,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-23 03:56:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-23 03:56:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1497, Unknown=0, NotChecked=0, Total=1640 [2022-11-23 03:56:08,199 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 41 states, 37 states have (on average 2.081081081081081) internal successors, (77), 40 states have internal predecessors, (77), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 03:56:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:56:11,662 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2022-11-23 03:56:11,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-23 03:56:11,662 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 2.081081081081081) internal successors, (77), 40 states have internal predecessors, (77), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) Word has length 43 [2022-11-23 03:56:11,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:56:11,666 INFO L225 Difference]: With dead ends: 184 [2022-11-23 03:56:11,666 INFO L226 Difference]: Without dead ends: 123 [2022-11-23 03:56:11,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=563, Invalid=4129, Unknown=0, NotChecked=0, Total=4692 [2022-11-23 03:56:11,669 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 261 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:56:11,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 804 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 03:56:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-23 03:56:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2022-11-23 03:56:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 85 states have internal predecessors, (96), 15 states have call successors, (15), 7 states have call predecessors, (15), 15 states have return successors, (26), 15 states have call predecessors, (26), 13 states have call successors, (26) [2022-11-23 03:56:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2022-11-23 03:56:11,695 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 43 [2022-11-23 03:56:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:56:11,696 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2022-11-23 03:56:11,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 2.081081081081081) internal successors, (77), 40 states have internal predecessors, (77), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 03:56:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2022-11-23 03:56:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-23 03:56:11,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:56:11,697 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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-23 03:56:11,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:56:11,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:56:11,905 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:56:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:11,906 INFO L85 PathProgramCache]: Analyzing trace with hash 828672736, now seen corresponding path program 1 times [2022-11-23 03:56:11,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:11,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908297934] [2022-11-23 03:56:11,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:11,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:56:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:56:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 03:56:12,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:12,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908297934] [2022-11-23 03:56:12,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908297934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:56:12,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:56:12,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 03:56:12,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258372250] [2022-11-23 03:56:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:56:12,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:56:12,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:12,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:56:12,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:56:12,136 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 03:56:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:56:12,217 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2022-11-23 03:56:12,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:56:12,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-11-23 03:56:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:56:12,222 INFO L225 Difference]: With dead ends: 137 [2022-11-23 03:56:12,222 INFO L226 Difference]: Without dead ends: 135 [2022-11-23 03:56:12,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:56:12,223 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:56:12,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 324 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:56:12,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-23 03:56:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 110. [2022-11-23 03:56:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.240506329113924) internal successors, (98), 85 states have internal predecessors, (98), 15 states have call successors, (15), 7 states have call predecessors, (15), 15 states have return successors, (26), 17 states have call predecessors, (26), 13 states have call successors, (26) [2022-11-23 03:56:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 139 transitions. [2022-11-23 03:56:12,244 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 139 transitions. Word has length 44 [2022-11-23 03:56:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:56:12,244 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 139 transitions. [2022-11-23 03:56:12,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 03:56:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 139 transitions. [2022-11-23 03:56:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-23 03:56:12,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:56:12,246 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:12,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 03:56:12,246 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:56:12,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash 191887930, now seen corresponding path program 1 times [2022-11-23 03:56:12,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:12,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954162437] [2022-11-23 03:56:12,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:12,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:56:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-23 03:56:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-23 03:56:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:12,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954162437] [2022-11-23 03:56:12,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954162437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:56:12,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376077771] [2022-11-23 03:56:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:12,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:56:12,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:56:12,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:56:12,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:56:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:12,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-23 03:56:12,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:56:12,781 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-23 03:56:12,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:12,813 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:56:12,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:12,818 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 16 treesize of output 18 [2022-11-23 03:56:12,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:12,828 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:56:12,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:12,834 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 16 treesize of output 18 [2022-11-23 03:56:12,924 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:56:12,925 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-23 03:56:12,975 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-23 03:56:12,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:12,999 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:56:13,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 03:56:13,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:13,025 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:56:13,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 39 [2022-11-23 03:56:13,267 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-23 03:56:13,273 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-23 03:56:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 03:56:13,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:56:13,354 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 10 treesize of output 4 [2022-11-23 03:56:13,488 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_821 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~tail~0#1.offset|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4) 0)) |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_821) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))) is different from false [2022-11-23 03:56:13,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:56:13,840 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 2 case distinctions, treesize of input 57 treesize of output 50 [2022-11-23 03:56:13,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:56:13,863 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 624 treesize of output 614 [2022-11-23 03:56:13,875 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 598 treesize of output 534 [2022-11-23 03:56:13,903 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 642 treesize of output 610 [2022-11-23 03:56:13,959 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 550 treesize of output 518 [2022-11-23 03:56:14,063 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 412 treesize of output 392 [2022-11-23 03:56:14,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:56:14,262 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 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-23 03:56:14,268 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 276 treesize of output 258 [2022-11-23 03:56:14,290 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 85 treesize of output 81 [2022-11-23 03:56:14,300 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 166 treesize of output 154 [2022-11-23 03:56:14,307 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 154 treesize of output 130 [2022-11-23 03:56:14,388 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 10 treesize of output 8 [2022-11-23 03:56:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 1 not checked. [2022-11-23 03:56:14,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376077771] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:56:14,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:56:14,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2022-11-23 03:56:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807838116] [2022-11-23 03:56:14,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:56:14,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 03:56:14,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:14,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 03:56:14,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=326, Unknown=2, NotChecked=36, Total=420 [2022-11-23 03:56:14,414 INFO L87 Difference]: Start difference. First operand 110 states and 139 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-23 03:56:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:56:15,522 INFO L93 Difference]: Finished difference Result 226 states and 281 transitions. [2022-11-23 03:56:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 03:56:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 47 [2022-11-23 03:56:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:56:15,524 INFO L225 Difference]: With dead ends: 226 [2022-11-23 03:56:15,524 INFO L226 Difference]: Without dead ends: 134 [2022-11-23 03:56:15,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=302, Invalid=960, Unknown=2, NotChecked=68, Total=1332 [2022-11-23 03:56:15,526 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 116 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:56:15,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 580 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 402 Invalid, 0 Unknown, 61 Unchecked, 0.5s Time] [2022-11-23 03:56:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-23 03:56:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 84. [2022-11-23 03:56:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 65 states have internal predecessors, (74), 12 states have call successors, (12), 6 states have call predecessors, (12), 11 states have return successors, (19), 12 states have call predecessors, (19), 10 states have call successors, (19) [2022-11-23 03:56:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-11-23 03:56:15,542 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 47 [2022-11-23 03:56:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:56:15,543 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-11-23 03:56:15,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-23 03:56:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-11-23 03:56:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 03:56:15,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:56:15,544 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:56:15,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:56:15,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 03:56:15,751 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:56:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1865771786, now seen corresponding path program 1 times [2022-11-23 03:56:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:15,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374597780] [2022-11-23 03:56:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:15,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:56:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:15,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:56:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:15,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-23 03:56:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 03:56:15,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:15,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374597780] [2022-11-23 03:56:15,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374597780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:56:15,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900142469] [2022-11-23 03:56:15,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:15,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:56:15,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:56:15,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:56:15,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 03:56:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:16,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 03:56:16,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:56:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 03:56:16,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:56:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 03:56:16,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900142469] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:56:16,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:56:16,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-23 03:56:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525400005] [2022-11-23 03:56:16,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:56:16,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 03:56:16,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:56:16,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 03:56:16,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-23 03:56:16,251 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-23 03:56:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:56:16,480 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2022-11-23 03:56:16,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:56:16,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 46 [2022-11-23 03:56:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:56:16,482 INFO L225 Difference]: With dead ends: 142 [2022-11-23 03:56:16,482 INFO L226 Difference]: Without dead ends: 91 [2022-11-23 03:56:16,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-23 03:56:16,483 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 98 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:56:16,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 169 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:56:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-23 03:56:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-11-23 03:56:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.196969696969697) internal successors, (79), 68 states have internal predecessors, (79), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (19), 12 states have call predecessors, (19), 10 states have call successors, (19) [2022-11-23 03:56:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2022-11-23 03:56:16,509 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 46 [2022-11-23 03:56:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:56:16,509 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2022-11-23 03:56:16,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-23 03:56:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-11-23 03:56:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-23 03:56:16,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:56:16,510 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 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-23 03:56:16,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:56:16,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 03:56:16,717 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:56:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:56:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash 604583819, now seen corresponding path program 2 times [2022-11-23 03:56:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:56:16,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087661606] [2022-11-23 03:56:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:56:16,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:56:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:17,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:56:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:17,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:56:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:56:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:56:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 03:56:17,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:56:17,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087661606] [2022-11-23 03:56:17,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087661606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:56:17,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098999698] [2022-11-23 03:56:17,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:56:17,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:56:17,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:56:17,589 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:56:17,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 03:56:17,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:56:17,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:56:17,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-23 03:56:17,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:56:17,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:17,830 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:56:17,842 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:56:17,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 03:56:17,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:56:17,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:17,855 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:56:17,869 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:56:17,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 03:56:17,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 03:56:18,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:18,278 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-23 03:56:18,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 80 [2022-11-23 03:56:18,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:56:18,317 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2022-11-23 03:56:18,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 79 [2022-11-23 03:56:35,220 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:56:47,372 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:56:55,610 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:57:05,818 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:57:13,991 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:57:22,263 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:57:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:57:22,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:57:22,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098999698] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:57:22,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:57:22,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 33 [2022-11-23 03:57:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87632480] [2022-11-23 03:57:22,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:57:22,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 03:57:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 03:57:22,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=997, Unknown=7, NotChecked=0, Total=1122 [2022-11-23 03:57:22,845 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-23 03:57:26,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:30,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:32,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:34,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:36,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:38,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:40,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:42,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:50,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:52,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:54,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:57:56,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:06,715 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:58:08,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:16,836 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:58:34,971 WARN L233 SmtUtils]: Spent 16.06s on a formula simplification. DAG size of input: 65 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:58:36,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:41,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:43,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:45,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:47,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:49,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:51,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:53,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:55,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:57,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:59,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:01,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:03,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:05,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:07,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:09,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:11,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:13,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:14,013 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2022-11-23 03:59:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 03:59:14,014 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 50 [2022-11-23 03:59:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:14,015 INFO L225 Difference]: With dead ends: 155 [2022-11-23 03:59:14,015 INFO L226 Difference]: Without dead ends: 80 [2022-11-23 03:59:14,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 111.9s TimeCoverageRelationStatistics Valid=360, Invalid=2382, Unknown=14, NotChecked=0, Total=2756 [2022-11-23 03:59:14,020 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 179 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 68 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:14,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 430 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 546 Invalid, 31 Unknown, 0 Unchecked, 63.2s Time] [2022-11-23 03:59:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-23 03:59:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2022-11-23 03:59:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-23 03:59:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2022-11-23 03:59:14,039 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 50 [2022-11-23 03:59:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:14,040 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2022-11-23 03:59:14,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-23 03:59:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2022-11-23 03:59:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 03:59:14,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:14,042 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:14,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:59:14,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 03:59:14,249 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash -664222695, now seen corresponding path program 1 times [2022-11-23 03:59:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:14,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501175179] [2022-11-23 03:59:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:14,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:15,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:59:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:15,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:59:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:15,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:59:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:59:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:15,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:59:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-23 03:59:15,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:15,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501175179] [2022-11-23 03:59:15,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501175179] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:15,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319640084] [2022-11-23 03:59:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:15,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:15,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:15,318 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:15,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 03:59:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:15,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-23 03:59:15,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:15,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:15,610 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:59:15,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:15,619 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:59:15,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:15,628 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 23 treesize of output 23 [2022-11-23 03:59:15,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:15,641 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 16 treesize of output 18 [2022-11-23 03:59:16,081 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:59:16,082 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 39 treesize of output 38 [2022-11-23 03:59:16,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:16,091 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 20 treesize of output 22 [2022-11-23 03:59:16,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:16,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-11-23 03:59:16,486 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-23 03:59:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 03:59:16,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:16,641 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1150) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1149 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1149) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) is different from false [2022-11-23 03:59:16,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319640084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:16,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:59:16,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2022-11-23 03:59:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003722660] [2022-11-23 03:59:16,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:16,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 03:59:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:16,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 03:59:16,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=429, Unknown=13, NotChecked=42, Total=552 [2022-11-23 03:59:16,771 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 6 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-23 03:59:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:19,132 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2022-11-23 03:59:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 03:59:19,132 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 6 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 53 [2022-11-23 03:59:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:19,133 INFO L225 Difference]: With dead ends: 124 [2022-11-23 03:59:19,133 INFO L226 Difference]: Without dead ends: 104 [2022-11-23 03:59:19,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=356, Invalid=1356, Unknown=14, NotChecked=80, Total=1806 [2022-11-23 03:59:19,135 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 327 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:19,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 319 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 03:59:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-23 03:59:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 69. [2022-11-23 03:59:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 54 states have internal predecessors, (60), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-23 03:59:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-11-23 03:59:19,158 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 53 [2022-11-23 03:59:19,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:19,158 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-11-23 03:59:19,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 6 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-23 03:59:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-11-23 03:59:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 03:59:19,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:19,159 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:19,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:59:19,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:19,367 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1675339945, now seen corresponding path program 1 times [2022-11-23 03:59:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:19,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164650849] [2022-11-23 03:59:19,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:59:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:59:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:59:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:20,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:59:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:59:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-23 03:59:20,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:20,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164650849] [2022-11-23 03:59:20,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164650849] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:20,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726825826] [2022-11-23 03:59:20,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:20,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:20,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:20,298 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:20,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 03:59:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:20,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-23 03:59:20,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:20,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:20,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:59:20,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:20,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-23 03:59:20,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:20,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:59:20,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:20,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-23 03:59:21,347 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:59:21,347 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-11-23 03:59:21,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:21,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-11-23 03:59:22,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:22,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:22,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:59:22,357 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 03:59:22,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2022-11-23 03:59:22,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:22,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2022-11-23 03:59:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:59:22,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:23,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726825826] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:23,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:59:23,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2022-11-23 03:59:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762490543] [2022-11-23 03:59:23,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:23,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 03:59:23,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 03:59:23,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1474, Unknown=0, NotChecked=0, Total=1640 [2022-11-23 03:59:23,713 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-23 03:59:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:26,570 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-11-23 03:59:26,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 03:59:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 53 [2022-11-23 03:59:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:26,571 INFO L225 Difference]: With dead ends: 83 [2022-11-23 03:59:26,571 INFO L226 Difference]: Without dead ends: 78 [2022-11-23 03:59:26,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=549, Invalid=3357, Unknown=0, NotChecked=0, Total=3906 [2022-11-23 03:59:26,573 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 199 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:26,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 424 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 03:59:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-23 03:59:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2022-11-23 03:59:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 54 states have internal predecessors, (60), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-23 03:59:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-11-23 03:59:26,588 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 53 [2022-11-23 03:59:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:26,588 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-11-23 03:59:26,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-23 03:59:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-11-23 03:59:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 03:59:26,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:26,590 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:26,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-23 03:59:26,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 03:59:26,791 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1417174507, now seen corresponding path program 1 times [2022-11-23 03:59:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:26,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579638651] [2022-11-23 03:59:26,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:27,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:59:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:27,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:59:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:59:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:27,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:59:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:27,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:59:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-23 03:59:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:27,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579638651] [2022-11-23 03:59:27,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579638651] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:27,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431978142] [2022-11-23 03:59:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:27,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:27,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:27,254 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:27,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 03:59:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:27,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-23 03:59:27,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:27,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:27,547 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:59:27,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:27,552 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 23 treesize of output 23 [2022-11-23 03:59:27,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:27,562 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:59:27,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:27,570 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 23 treesize of output 23 [2022-11-23 03:59:28,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:28,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-11-23 03:59:28,106 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 03:59:28,106 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 37 treesize of output 36 [2022-11-23 03:59:28,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:28,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:59:28,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-23 03:59:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:59:28,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:28,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431978142] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:28,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:59:28,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2022-11-23 03:59:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025420922] [2022-11-23 03:59:28,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:28,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 03:59:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 03:59:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-11-23 03:59:28,792 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-23 03:59:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:30,272 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-11-23 03:59:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 03:59:30,273 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 53 [2022-11-23 03:59:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:30,273 INFO L225 Difference]: With dead ends: 81 [2022-11-23 03:59:30,274 INFO L226 Difference]: Without dead ends: 69 [2022-11-23 03:59:30,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=1048, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 03:59:30,275 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 204 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:30,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 238 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:59:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-23 03:59:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-11-23 03:59:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-23 03:59:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-11-23 03:59:30,296 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 53 [2022-11-23 03:59:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:30,297 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-11-23 03:59:30,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-23 03:59:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-11-23 03:59:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-23 03:59:30,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:30,298 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:30,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 03:59:30,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:30,506 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:30,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash -160259518, now seen corresponding path program 2 times [2022-11-23 03:59:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:30,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823086516] [2022-11-23 03:59:30,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:30,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:59:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:59:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:59:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:59:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:30,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:59:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:59:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-23 03:59:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:30,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823086516] [2022-11-23 03:59:30,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823086516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:59:30,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:59:30,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:59:30,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260011718] [2022-11-23 03:59:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:59:30,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:59:30,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:59:30,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:59:30,763 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-23 03:59:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:30,820 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-11-23 03:59:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:59:30,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 59 [2022-11-23 03:59:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:30,825 INFO L225 Difference]: With dead ends: 77 [2022-11-23 03:59:30,825 INFO L226 Difference]: Without dead ends: 67 [2022-11-23 03:59:30,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:59:30,826 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:30,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:59:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-23 03:59:30,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-11-23 03:59:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-23 03:59:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-11-23 03:59:30,847 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 59 [2022-11-23 03:59:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:30,847 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-11-23 03:59:30,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-23 03:59:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-11-23 03:59:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 03:59:30,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:30,852 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:30,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 03:59:30,852 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:30,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1055504788, now seen corresponding path program 3 times [2022-11-23 03:59:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:30,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115143305] [2022-11-23 03:59:30,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:30,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:59:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:59:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:59:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:59:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:59:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 03:59:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 03:59:31,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:31,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115143305] [2022-11-23 03:59:31,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115143305] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:31,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041502261] [2022-11-23 03:59:31,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:59:31,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:31,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:32,002 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:32,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 03:59:32,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-23 03:59:32,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:59:32,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 133 conjunts are in the unsatisfiable core [2022-11-23 03:59:32,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:32,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:32,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 03:59:32,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:32,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-23 03:59:32,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:32,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-23 03:59:33,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:33,212 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 03:59:33,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 44 [2022-11-23 03:59:33,234 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 03:59:33,234 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 1 case distinctions, treesize of input 25 treesize of output 31 [2022-11-23 03:59:33,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:33,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-23 03:59:33,261 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 3 [2022-11-23 03:59:33,274 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 21 treesize of output 17 [2022-11-23 03:59:35,444 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_22|) 4))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_22|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_32| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_32|))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_32| 0)) (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_32|) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_32|) 0)) (= (select .cse1 0) 0) (= (select .cse1 4) 0))))) is different from true [2022-11-23 03:59:45,628 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:59:53,725 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:00:01,834 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:00:02,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:02,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:02,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 04:00:02,532 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-23 04:00:02,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 47 [2022-11-23 04:00:02,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:02,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:02,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-11-23 04:00:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-11-23 04:00:03,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 04:00:19,778 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:00:30,011 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:00:40,243 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:00:40,309 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|))) (and (forall ((v_ArrVal_1508 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1508))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store .cse0 .cse2 (store (select .cse0 .cse2) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1507) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4) |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_1508 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1508))) (or (forall ((v_ArrVal_1507 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1507))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4) |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (not (= (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0))))))) is different from false [2022-11-23 04:00:40,392 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1508 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1508))) (or (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1507) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4) |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0))))) (forall ((v_ArrVal_1508 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1508))) (or (not (= (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1507))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4) |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.offset|))))))) is different from false [2022-11-23 04:00:40,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041502261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:00:40,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 04:00:40,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28] total 41 [2022-11-23 04:00:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479441781] [2022-11-23 04:00:40,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 04:00:40,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-23 04:00:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:00:40,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-23 04:00:40,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2238, Unknown=8, NotChecked=294, Total=2756 [2022-11-23 04:00:40,806 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 41 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 12 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-23 04:00:52,719 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:01:00,841 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:01:07,003 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:01:13,200 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:01:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:01:16,748 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-11-23 04:01:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-23 04:01:16,749 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 12 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) Word has length 60 [2022-11-23 04:01:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:01:16,750 INFO L225 Difference]: With dead ends: 91 [2022-11-23 04:01:16,750 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 04:01:16,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 100.0s TimeCoverageRelationStatistics Valid=954, Invalid=6532, Unknown=8, NotChecked=516, Total=8010 [2022-11-23 04:01:16,754 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 321 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-23 04:01:16,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 506 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 988 Invalid, 0 Unknown, 76 Unchecked, 2.5s Time] [2022-11-23 04:01:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 04:01:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 04:01:16,755 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-23 04:01:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 04:01:16,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2022-11-23 04:01:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:01:16,756 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 04:01:16,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 12 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-23 04:01:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 04:01:16,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 04:01:16,759 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 04:01:16,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 04:01:16,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:01:16,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 04:01:57,106 WARN L233 SmtUtils]: Spent 34.49s on a formula simplification. DAG size of input: 361 DAG size of output: 164 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-23 04:01:58,005 INFO L895 garLoopResultBuilder]: At program point L622(line 622) the Hoare annotation is: (let ((.cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~tail~0#1.base|)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse2 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|))) (or (and .cse0 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) .cse1 .cse2 .cse3) (let ((.cse6 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse5 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) .cse6)) (.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_re_insert_~x#1.base|)) (.cse9 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_re_insert_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select .cse4 .cse5) 0) .cse0 (= (select .cse4 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) .cse6) |ULTIMATE.start_main_~x~0#1.offset|) .cse1 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (= (select .cse7 .cse5) 0) (= |ULTIMATE.start_re_insert_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse8) .cse9) 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) .cse2 (<= (+ |ULTIMATE.start_main_~n~0#1.base| 2) |ULTIMATE.start_main_~#list~0#1.base|) .cse3 (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) (= .cse8 |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~tail~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse7 |ULTIMATE.start_main_~n~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (<= (+ |ULTIMATE.start_re_insert_~x#1.base| 2) (select .cse10 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse10 |ULTIMATE.start_re_insert_~x#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) (= |ULTIMATE.start_main_~n~0#1.offset| 0) (= 0 (select .cse11 .cse9)) (= (select .cse11 |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|)))))) [2022-11-23 04:01:58,005 INFO L895 garLoopResultBuilder]: At program point L622-1(line 622) the Hoare annotation is: (and (= |ULTIMATE.start_main_#t~ret22#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~tail~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) [2022-11-23 04:01:58,006 INFO L899 garLoopResultBuilder]: For program point L622-2(line 622) no Hoare annotation was computed. [2022-11-23 04:01:58,006 INFO L899 garLoopResultBuilder]: For program point L618(line 618) no Hoare annotation was computed. [2022-11-23 04:01:58,006 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 582) no Hoare annotation was computed. [2022-11-23 04:01:58,006 INFO L899 garLoopResultBuilder]: For program point L3(line 3) no Hoare annotation was computed. [2022-11-23 04:01:58,006 INFO L899 garLoopResultBuilder]: For program point L581-2(lines 581 582) no Hoare annotation was computed. [2022-11-23 04:01:58,006 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 611) no Hoare annotation was computed. [2022-11-23 04:01:58,006 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-23 04:01:58,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 04:01:58,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-23 04:01:58,006 INFO L902 garLoopResultBuilder]: At program point L623(lines 601 624) the Hoare annotation is: true [2022-11-23 04:01:58,006 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 591) no Hoare annotation was computed. [2022-11-23 04:01:58,007 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 592) no Hoare annotation was computed. [2022-11-23 04:01:58,007 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 616) no Hoare annotation was computed. [2022-11-23 04:01:58,007 INFO L895 garLoopResultBuilder]: At program point L615-2(lines 607 617) the Hoare annotation is: (let ((.cse30 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse29 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse34 (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse8 (select .cse29 .cse34)) (.cse18 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse31 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse5 (select .cse30 .cse34)) (.cse33 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse32 (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse19 (= (select .cse33 .cse32) 0)) (.cse0 (= (select .cse33 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|)) (.cse3 (= .cse5 0)) (.cse21 (= (select .cse31 .cse32) 0)) (.cse16 (select .cse18 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (.cse12 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse23 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse20 (+ |ULTIMATE.start_main_~n~0#1.base| 2)) (.cse24 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse13 (= |ULTIMATE.start_main_~tail~0#1.offset| 0)) (.cse14 (not (= |ULTIMATE.start_main_~tail~0#1.base| 0))) (.cse2 (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse31 |ULTIMATE.start_main_~n~0#1.offset|))) (.cse25 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|)) (.cse6 (select .cse30 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse15 (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)) (.cse22 (= |ULTIMATE.start_main_~n~0#1.offset| 0)) (.cse4 (= 0 .cse8)) (.cse7 (select .cse29 |ULTIMATE.start_main_~x~0#1.offset|))) (or (and (let ((.cse1 (let ((.cse10 (let ((.cse17 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (or (and .cse17 .cse3 (= (select .cse18 |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) .cse4) (and .cse19 .cse17 (<= .cse20 |ULTIMATE.start_main_~tail~0#1.base|) .cse21 .cse22)))) (.cse11 (not (= .cse16 |ULTIMATE.start_main_~x~0#1.base|)))) (or (and .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse4) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (or (and (= .cse5 .cse6) (= .cse7 .cse8)) (let ((.cse9 (+ .cse7 4))) (and (= (select (select |#memory_$Pointer$.offset| .cse6) .cse9) .cse8) (= .cse5 (select (select |#memory_$Pointer$.base| .cse6) .cse9)))))))) (= |ULTIMATE.start_main_~x~0#1.offset| 0) .cse23 .cse24 .cse25 (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31| Int)) (let ((.cse26 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31|))) (and (= (select .cse26 0) 0) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31| 0)) (= (select .cse26 4) 0))))) (and (= |ULTIMATE.start_main_~#list~0#1.base| .cse6) .cse19 .cse0 .cse3 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= |ULTIMATE.start_main_~n~0#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) .cse21 (not (= .cse16 0)) .cse12 .cse23 (<= .cse20 |ULTIMATE.start_main_~#list~0#1.base|) .cse24 (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) .cse13 .cse14 .cse2 (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) .cse25 (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) .cse6) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse27 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) 0)) (.cse28 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|))) (and (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| (select (select |#memory_$Pointer$.base| .cse27) 4)) (= (select .cse28 4) 0) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| 0)) (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) .cse27) (= (select (select |#memory_$Pointer$.offset| .cse27) 4) 0) (= (select .cse28 0) 0)))) .cse15 .cse22 .cse4 (= .cse7 |ULTIMATE.start_main_~#list~0#1.offset|)))))) [2022-11-23 04:01:58,007 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 04:01:58,008 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 617) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse18 (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse2 (= (select .cse9 .cse18) 0)) (.cse4 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse8 (= 0 (select .cse17 .cse18))) (.cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~tail~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse13 (+ |ULTIMATE.start_main_~n~0#1.base| 2)) (.cse6 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse7 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse16 (= |ULTIMATE.start_main_~n~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select .cse5 |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) .cse6 .cse7 .cse8) (let ((.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse11 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|))) (and (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse9 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select .cse10 .cse11) 0) (= (select .cse10 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|) .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (= (select .cse12 .cse11) 0) (not (= (select .cse5 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4)) 0)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= .cse13 |ULTIMATE.start_main_~#list~0#1.base|) .cse7 (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (not (= |ULTIMATE.start_main_~tail~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse12 |ULTIMATE.start_main_~n~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse14 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) 0)) (.cse15 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|))) (and (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| (select (select |#memory_$Pointer$.base| .cse14) 4)) (= (select .cse15 4) 0) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| 0)) (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) .cse14) (= (select (select |#memory_$Pointer$.offset| .cse14) 4) 0) (= (select .cse15 0) 0)))) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) .cse16 .cse8 (= (select .cse17 |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|))) (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_3|) 4) 0))) .cse3 (<= .cse13 |ULTIMATE.start_main_~tail~0#1.base|) .cse6 .cse7 .cse16)))) [2022-11-23 04:01:58,008 INFO L899 garLoopResultBuilder]: For program point L620(line 620) no Hoare annotation was computed. [2022-11-23 04:01:58,009 INFO L895 garLoopResultBuilder]: At program point L620-2(line 620) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse7 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse8 (select .cse9 |ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse4 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse1 (+ .cse8 4)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse0 (select .cse6 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (select .cse9 .cse7))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) .cse1) .cse2) (= |ULTIMATE.start_main_~#list~0#1.base| .cse0) (= (select .cse3 .cse4) 0) (= (select .cse3 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (= (select .cse5 .cse4) 0) (not |ULTIMATE.start_main_#t~short21#1|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0) (<= (+ |ULTIMATE.start_main_~n~0#1.base| 2) |ULTIMATE.start_main_~#list~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|) (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) (= (select .cse6 .cse7) (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (not (= |ULTIMATE.start_main_~tail~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse5 |ULTIMATE.start_main_~n~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) .cse0) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) (= |ULTIMATE.start_main_~n~0#1.offset| 0) (= 0 .cse2) (= .cse8 |ULTIMATE.start_main_~#list~0#1.offset|))))) [2022-11-23 04:01:58,009 INFO L899 garLoopResultBuilder]: For program point L620-3(line 620) no Hoare annotation was computed. [2022-11-23 04:01:58,009 INFO L895 garLoopResultBuilder]: At program point L620-4(line 620) the Hoare annotation is: (let ((.cse5 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~tail~0#1.base|)) (.cse6 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse8 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|))) (or (let ((.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse10 (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse4 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse2 (select .cse11 .cse10)) (.cse0 (select .cse9 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (select .cse11 |ULTIMATE.start_main_~x~0#1.offset|))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) (+ .cse1 4)) .cse2) (= |ULTIMATE.start_main_~#list~0#1.base| .cse0) (= (select .cse3 .cse4) 0) .cse5 (= (select .cse3 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~short21#1| .cse6 (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (= (select .cse7 .cse4) 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) (+ |ULTIMATE.start_remove_~x#1.offset| 4)) 0) (<= (+ |ULTIMATE.start_main_~n~0#1.base| 2) |ULTIMATE.start_main_~#list~0#1.base|) .cse8 (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (not (= |ULTIMATE.start_main_~tail~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse7 |ULTIMATE.start_main_~n~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) .cse0) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) (= |ULTIMATE.start_main_~n~0#1.offset| 0) (= 0 .cse2) (= (select .cse9 .cse10) (select (select |#memory_$Pointer$.base| .cse0) (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (= .cse1 |ULTIMATE.start_main_~#list~0#1.offset|)))) (and .cse5 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_#t~short21#1| .cse6 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) .cse8))) [2022-11-23 04:01:58,009 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 584) no Hoare annotation was computed. [2022-11-23 04:01:58,010 INFO L899 garLoopResultBuilder]: For program point L620-5(line 620) no Hoare annotation was computed. [2022-11-23 04:01:58,010 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 585) no Hoare annotation was computed. [2022-11-23 04:01:58,010 INFO L899 garLoopResultBuilder]: For program point L588(lines 588 589) no Hoare annotation was computed. [2022-11-23 04:01:58,010 INFO L899 garLoopResultBuilder]: For program point L588-2(lines 588 589) no Hoare annotation was computed. [2022-11-23 04:01:58,010 INFO L899 garLoopResultBuilder]: For program point L2(lines 2 4) no Hoare annotation was computed. [2022-11-23 04:01:58,010 INFO L902 garLoopResultBuilder]: At program point is_list_containing_xENTRY(lines 593 600) the Hoare annotation is: true [2022-11-23 04:01:58,011 INFO L895 garLoopResultBuilder]: At program point L598(line 598) the Hoare annotation is: (let ((.cse0 (let ((.cse19 (+ |is_list_containing_x_#in~l.offset| 4))) (let ((.cse18 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) .cse19)) (.cse17 (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) .cse19))) (and (= .cse17 |is_list_containing_x_#t~mem14.base|) (= |is_list_containing_x_#t~mem14.offset| .cse18) (or (not (= .cse18 0)) (not (= .cse17 0)))))))) (and (or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse3 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8|))) (let ((.cse1 (select .cse3 0)) (.cse2 (select .cse3 4))) (or (not (= (select (select |#memory_$Pointer$.base| .cse1) 4) .cse2)) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| 0) (not (<= (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| 2) .cse1)) (not (= .cse2 0)))))) (forall ((|ULTIMATE.start_main_~x~0#1.base| Int)) (let ((.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (select .cse10 0)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse4 (select .cse10 4)) (.cse7 (select .cse9 4)) (.cse6 (+ .cse8 4)) (.cse5 (select .cse9 0))) (or (not (= .cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (not (= .cse7 0)) (not (= .cse4 0)) (not (= .cse8 0)) (not (= .cse7 (select (select |#memory_$Pointer$.base| .cse5) .cse6))) (= .cse5 |ULTIMATE.start_main_~x~0#1.base|)))))) (and (forall ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_5| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| Int)) (= (select (select |#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_5|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| 4)) 0)) (forall ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_5| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| Int)) (= 0 (select (select |#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_5|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| 4))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7| Int)) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7|) 0) 0)) (not (<= (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7| 2) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7|) 0))) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7| 0)))) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse11 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_27|))) (let ((.cse12 (select .cse11 0))) (or (not (= (select .cse11 4) 0)) (not (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_27|) .cse12)) (= .cse12 0))))) .cse0 (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse13 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_21|)) (.cse14 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_21|))) (or (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_21| 0) (not (= (select .cse13 4) 0)) (not (= (select .cse13 0) 0)) (not (= (select .cse14 4) 0)) (not (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_21|) (select .cse14 0)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse16 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) 0)) (.cse15 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|))) (or (not (= (select .cse15 0) 0)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| (select (select |#memory_$Pointer$.base| .cse16) 4))) (not (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) .cse16)) (not (= (select (select |#memory_$Pointer$.offset| .cse16) 4) 0)) (not (= (select .cse15 4) 0)) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| 0))))))) [2022-11-23 04:01:58,011 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xFINAL(lines 593 600) no Hoare annotation was computed. [2022-11-23 04:01:58,012 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 598) no Hoare annotation was computed. [2022-11-23 04:01:58,012 INFO L899 garLoopResultBuilder]: For program point L598-1(line 598) no Hoare annotation was computed. [2022-11-23 04:01:58,012 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 596) no Hoare annotation was computed. [2022-11-23 04:01:58,012 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xEXIT(lines 593 600) no Hoare annotation was computed. [2022-11-23 04:01:58,012 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 23) no Hoare annotation was computed. [2022-11-23 04:01:58,012 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 23) the Hoare annotation is: true [2022-11-23 04:01:58,013 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 23) no Hoare annotation was computed. [2022-11-23 04:01:58,013 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-11-23 04:01:58,013 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 21) no Hoare annotation was computed. [2022-11-23 04:01:58,013 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-11-23 04:01:58,017 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:01:58,019 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 04:01:58,038 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,041 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,041 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,041 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,042 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,042 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,042 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,042 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,048 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,048 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,048 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,049 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,049 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,054 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,054 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,055 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,055 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,055 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,055 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,057 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,058 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,059 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,059 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,059 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,059 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,061 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,070 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,071 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,071 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,071 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,072 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,072 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,072 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,078 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,078 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,078 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,079 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,079 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,079 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,079 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,080 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,080 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,080 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,081 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,081 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,081 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,083 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,083 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,083 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,083 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,085 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,085 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,085 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,085 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,086 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,086 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,086 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,086 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,087 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,087 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,087 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,088 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,088 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,088 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,089 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,089 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,090 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,091 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,091 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,091 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,092 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,092 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:01:58 BoogieIcfgContainer [2022-11-23 04:01:58,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 04:01:58,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 04:01:58,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 04:01:58,100 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 04:01:58,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:55:52" (3/4) ... [2022-11-23 04:01:58,104 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 04:01:58,111 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2022-11-23 04:01:58,112 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-23 04:01:58,116 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-23 04:01:58,117 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-23 04:01:58,117 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-23 04:01:58,118 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 04:01:58,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[x][x + 4] == 0 && (((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0))) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && 0 == #memory_$Pointer$[x][x + 4]) || ((((((((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0)) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && \valid[n] == 1))) && list == #memory_$Pointer$[n][n]) || (((#memory_$Pointer$[x][x + 4] == 0 && (((((((#memory_$Pointer$[x][x + 4] == 0 && (((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0))) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && 0 == #memory_$Pointer$[x][x + 4]) || ((((((((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0)) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && \valid[n] == 1))) && 0 == #memory_$Pointer$[x][x + 4]) && ((#memory_$Pointer$[x][x + 4] == #memory_$Pointer$[x][x] && #memory_$Pointer$[x][x] == #memory_$Pointer$[x][x + 4]) || (#memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == #memory_$Pointer$[x][x + 4] && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4])))) && x == 0) && list == x) && unknown-#StackHeapBarrier-unknown < list) && list == tail) && (\exists v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31 : int :: (#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31][0] == 0 && !(v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31 == 0)) && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31][4] == 0)) || (((((((((((((((((((((((list == #memory_$Pointer$[x][x] && #memory_$Pointer$[n][n + 4] == 0) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[x][x + 4] == 0) && \valid[list] == 1) && n == list) && #memory_$Pointer$[n][n + 4] == 0) && !(#memory_$Pointer$[list][list + 4] == 0)) && \valid[x] == 1) && list == x) && n + 2 <= list) && unknown-#StackHeapBarrier-unknown < list) && !(n == 0)) && tail == 0) && !(tail == 0)) && list == #memory_$Pointer$[n][n]) && !(x == 0)) && list == tail) && 2 + x <= #memory_$Pointer$[x][x]) && (\exists v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 : int :: ((((v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 == #memory_$Pointer$[#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]][4] && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][4] == 0) && !(v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 == 0)) && 2 + v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 <= #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]) && #memory_$Pointer$[#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]][4] == 0) && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0] == 0)) && \valid[n] == 1) && n == 0) && 0 == #memory_$Pointer$[x][x + 4]) && #memory_$Pointer$[x][x] == list) [2022-11-23 04:01:58,162 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 04:01:58,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 04:01:58,163 INFO L158 Benchmark]: Toolchain (without parser) took 367180.85ms. Allocated memory was 153.1MB in the beginning and 285.2MB in the end (delta: 132.1MB). Free memory was 115.5MB in the beginning and 208.9MB in the end (delta: -93.4MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2022-11-23 04:01:58,163 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 111.1MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 04:01:58,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.55ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 98.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 04:01:58,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.02ms. Allocated memory is still 153.1MB. Free memory was 98.3MB in the beginning and 96.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 04:01:58,164 INFO L158 Benchmark]: Boogie Preprocessor took 69.03ms. Allocated memory is still 153.1MB. Free memory was 96.2MB in the beginning and 94.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 04:01:58,164 INFO L158 Benchmark]: RCFGBuilder took 676.87ms. Allocated memory is still 153.1MB. Free memory was 94.6MB in the beginning and 120.8MB in the end (delta: -26.2MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2022-11-23 04:01:58,164 INFO L158 Benchmark]: TraceAbstraction took 365791.50ms. Allocated memory was 153.1MB in the beginning and 285.2MB in the end (delta: 132.1MB). Free memory was 120.1MB in the beginning and 213.1MB in the end (delta: -93.1MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. [2022-11-23 04:01:58,165 INFO L158 Benchmark]: Witness Printer took 63.05ms. Allocated memory is still 285.2MB. Free memory was 213.1MB in the beginning and 208.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 04:01:58,166 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.27ms. Allocated memory is still 111.1MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.55ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 98.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.02ms. Allocated memory is still 153.1MB. Free memory was 98.3MB in the beginning and 96.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.03ms. Allocated memory is still 153.1MB. Free memory was 96.2MB in the beginning and 94.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 676.87ms. Allocated memory is still 153.1MB. Free memory was 94.6MB in the beginning and 120.8MB in the end (delta: -26.2MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 365791.50ms. Allocated memory was 153.1MB in the beginning and 285.2MB in the end (delta: 132.1MB). Free memory was 120.1MB in the beginning and 213.1MB in the end (delta: -93.1MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. * Witness Printer took 63.05ms. Allocated memory is still 285.2MB. Free memory was 213.1MB in the beginning and 208.9MB in the end (delta: 4.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$.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$.offset - 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$.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 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$.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$.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 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$.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 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$.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 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 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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,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$.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$.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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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 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$.offset - 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$.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 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$.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$.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 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$.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 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$.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 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 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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,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$.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$.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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,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 * 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: 20]: 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 3 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 365.6s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 162.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 41.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 2460 SdHoareTripleChecker+Valid, 72.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2450 mSDsluCounter, 6870 SdHoareTripleChecker+Invalid, 71.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 137 IncrementalHoareTripleChecker+Unchecked, 5882 mSDsCounter, 1009 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6409 IncrementalHoareTripleChecker+Invalid, 7586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1009 mSolverCounterUnsat, 988 mSDtfsCounter, 6409 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1447 GetRequests, 897 SyntacticMatches, 18 SemanticMatches, 532 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 5250 ImplicationChecksByTransitivity, 226.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=7, InterpolantAutomatonStates: 309, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 370 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 181 PreInvPairs, 199 NumberOfFragments, 1991 HoareAnnotationTreeSize, 181 FomulaSimplifications, 1444 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 10 FomulaSimplificationsInter, 164735 FormulaSimplificationTreeSizeReductionInter, 39.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 155.7s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1337 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1551 ConstructedInterpolants, 163 QuantifiedInterpolants, 18081 SizeOfPredicates, 211 NumberOfNonLiveVariables, 3525 ConjunctsInSsa, 694 ConjunctsInUnsatCore, 37 InterpolantComputations, 9 PerfectInterpolantSequences, 679/875 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: 601]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 607]: Loop Invariant [2022-11-23 04:01:58,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,191 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,191 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,191 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,191 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,193 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,201 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,201 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,201 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,201 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,202 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,202 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,202 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,202 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,202 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,203 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,203 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,204 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,204 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,204 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,205 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,206 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,206 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,209 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,213 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,213 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,213 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,213 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,214 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,214 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,214 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,215 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,215 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,215 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,215 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,223 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,223 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,223 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,223 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,223 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,224 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,224 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,224 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,224 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,224 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,225 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31,QUANTIFIED] [2022-11-23 04:01:58,225 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,225 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,225 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,226 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,226 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,226 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,226 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,227 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,227 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,227 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,227 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,228 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 04:01:58,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34,QUANTIFIED] [2022-11-23 04:01:58,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 04:01:58,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[x][x + 4] == 0 && (((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0))) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && 0 == #memory_$Pointer$[x][x + 4]) || ((((((((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0)) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && \valid[n] == 1))) && list == #memory_$Pointer$[n][n]) || (((#memory_$Pointer$[x][x + 4] == 0 && (((((((#memory_$Pointer$[x][x + 4] == 0 && (((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0))) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && 0 == #memory_$Pointer$[x][x + 4]) || ((((((((((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0) && #memory_$Pointer$[list][list] == 0) && 0 == #memory_$Pointer$[x][x + 4]) || ((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 2 <= tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0)) && !(#memory_$Pointer$[list][list + 4] == x)) && \valid[x] == 1) && tail == 0) && !(tail == 0)) && \valid[n] == 1))) && 0 == #memory_$Pointer$[x][x + 4]) && ((#memory_$Pointer$[x][x + 4] == #memory_$Pointer$[x][x] && #memory_$Pointer$[x][x] == #memory_$Pointer$[x][x + 4]) || (#memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == #memory_$Pointer$[x][x + 4] && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4])))) && x == 0) && list == x) && unknown-#StackHeapBarrier-unknown < list) && list == tail) && (\exists v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31 : int :: (#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31][0] == 0 && !(v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31 == 0)) && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_31][4] == 0)) || (((((((((((((((((((((((list == #memory_$Pointer$[x][x] && #memory_$Pointer$[n][n + 4] == 0) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[x][x + 4] == 0) && \valid[list] == 1) && n == list) && #memory_$Pointer$[n][n + 4] == 0) && !(#memory_$Pointer$[list][list + 4] == 0)) && \valid[x] == 1) && list == x) && n + 2 <= list) && unknown-#StackHeapBarrier-unknown < list) && !(n == 0)) && tail == 0) && !(tail == 0)) && list == #memory_$Pointer$[n][n]) && !(x == 0)) && list == tail) && 2 + x <= #memory_$Pointer$[x][x]) && (\exists v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 : int :: ((((v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 == #memory_$Pointer$[#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]][4] && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][4] == 0) && !(v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 == 0)) && 2 + v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34 <= #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]) && #memory_$Pointer$[#memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0]][4] == 0) && #memory_$Pointer$[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34][0] == 0)) && \valid[n] == 1) && n == 0) && 0 == #memory_$Pointer$[x][x + 4]) && #memory_$Pointer$[x][x] == list) RESULT: Ultimate proved your program to be correct! [2022-11-23 04:01:58,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07bd341-a28b-43f3-a919-64bac5ba15b2/bin/uautomizer-QkZJyEgLgS/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