./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 10:58:10,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:58:10,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:58:10,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:58:10,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:58:10,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:58:10,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:58:10,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:58:10,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:58:10,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:58:10,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:58:10,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:58:10,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:58:10,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:58:10,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:58:10,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:58:10,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:58:10,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:58:10,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:58:10,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:58:10,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:58:10,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:58:10,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:58:10,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:58:10,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:58:10,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:58:10,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:58:10,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:58:10,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:58:10,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:58:10,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:58:10,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:58:10,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:58:10,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:58:10,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:58:10,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:58:10,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:58:10,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:58:10,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:58:10,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:58:10,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:58:10,793 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 10:58:10,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:58:10,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:58:10,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 10:58:10,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 10:58:10,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 10:58:10,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 10:58:10,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:58:10,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:58:10,809 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:58:10,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:58:10,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:58:10,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:58:10,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:58:10,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:58:10,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:58:10,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:58:10,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:58:10,810 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:58:10,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:58:10,810 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:58:10,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:58:10,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:58:10,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:58:10,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:58:10,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:58:10,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:58:10,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:58:10,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:58:10,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:58:10,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:58:10,811 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 10:58:10,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 10:58:10,811 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 10:58:10,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 10:58:10,811 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 10:58:10,812 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_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/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_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8 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-12-13 10:58:10,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:58:10,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:58:10,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:58:10,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:58:10,991 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:58:10,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/heap-manipulation/dancing.i [2022-12-13 10:58:13,576 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:58:13,753 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:58:13,754 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/sv-benchmarks/c/heap-manipulation/dancing.i [2022-12-13 10:58:13,764 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/data/520150cfd/c8fed838e64e40299672812641eda585/FLAG0057d75ac [2022-12-13 10:58:13,775 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/data/520150cfd/c8fed838e64e40299672812641eda585 [2022-12-13 10:58:13,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:58:13,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 10:58:13,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:58:13,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:58:13,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:58:13,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:58:13" (1/1) ... [2022-12-13 10:58:13,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195578da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:13, skipping insertion in model container [2022-12-13 10:58:13,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:58:13" (1/1) ... [2022-12-13 10:58:13,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:58:13,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:58:13,942 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_01d1b8b7-10fd-48f5-abfd-0da905784058/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-12-13 10:58:14,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:58:14,054 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:58:14,063 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_01d1b8b7-10fd-48f5-abfd-0da905784058/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-12-13 10:58:14,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:58:14,112 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:58:14,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14 WrapperNode [2022-12-13 10:58:14,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:58:14,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:58:14,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:58:14,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:58:14,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,149 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-12-13 10:58:14,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:58:14,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:58:14,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:58:14,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:58:14,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,175 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:58:14,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:58:14,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:58:14,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:58:14,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (1/1) ... [2022-12-13 10:58:14,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:58:14,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 10:58:14,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 10:58:14,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 10:58:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-12-13 10:58:14,242 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-12-13 10:58:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 10:58:14,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 10:58:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 10:58:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:58:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:58:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 10:58:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 10:58:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:58:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:58:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:58:14,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:58:14,343 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 10:58:14,345 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:58:14,566 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 10:58:14,571 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:58:14,572 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 10:58:14,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:58:14 BoogieIcfgContainer [2022-12-13 10:58:14,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:58:14,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:58:14,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:58:14,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:58:14,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:58:13" (1/3) ... [2022-12-13 10:58:14,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60aa41d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:58:14, skipping insertion in model container [2022-12-13 10:58:14,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:58:14" (2/3) ... [2022-12-13 10:58:14,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60aa41d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:58:14, skipping insertion in model container [2022-12-13 10:58:14,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:58:14" (3/3) ... [2022-12-13 10:58:14,582 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-12-13 10:58:14,600 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:58:14,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:58:14,643 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:58:14,648 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;@1f651cd5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 10:58:14,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 10:58:14,651 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-12-13 10:58:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 10:58:14,657 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:14,657 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-12-13 10:58:14,658 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:14,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2022-12-13 10:58:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:14,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248798034] [2022-12-13 10:58:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:58:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:14,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248798034] [2022-12-13 10:58:14,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248798034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:58:14,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:58:14,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:58:14,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080547181] [2022-12-13 10:58:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:58:14,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 10:58:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:14,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 10:58:14,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 10:58:14,872 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-12-13 10:58:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:14,892 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-12-13 10:58:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 10:58:14,894 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-12-13 10:58:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:14,899 INFO L225 Difference]: With dead ends: 77 [2022-12-13 10:58:14,899 INFO L226 Difference]: Without dead ends: 37 [2022-12-13 10:58:14,902 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-12-13 10:58:14,905 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-12-13 10:58:14,906 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-12-13 10:58:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-13 10:58:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-12-13 10:58:14,937 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-12-13 10:58:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-12-13 10:58:14,938 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2022-12-13 10:58:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:14,939 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-12-13 10:58:14,939 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-12-13 10:58:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-12-13 10:58:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 10:58:14,940 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:14,941 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-12-13 10:58:14,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:58:14,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2022-12-13 10:58:14,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:14,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909183676] [2022-12-13 10:58:14,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:14,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:15,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:58:15,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:15,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909183676] [2022-12-13 10:58:15,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909183676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:58:15,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:58:15,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:58:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974249436] [2022-12-13 10:58:15,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:58:15,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:58:15,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:15,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:58:15,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:58:15,121 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-12-13 10:58:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:15,157 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-12-13 10:58:15,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:58:15,158 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-12-13 10:58:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:15,158 INFO L225 Difference]: With dead ends: 45 [2022-12-13 10:58:15,158 INFO L226 Difference]: Without dead ends: 43 [2022-12-13 10:58:15,159 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-12-13 10:58:15,160 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-12-13 10:58:15,160 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-12-13 10:58:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-13 10:58:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-12-13 10:58:15,164 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-12-13 10:58:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-12-13 10:58:15,165 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2022-12-13 10:58:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:15,166 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-12-13 10:58:15,167 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-12-13 10:58:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-12-13 10:58:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 10:58:15,167 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:15,167 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-12-13 10:58:15,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:58:15,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:15,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:15,168 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2022-12-13 10:58:15,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:15,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200791392] [2022-12-13 10:58:15,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:15,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:15,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 10:58:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 10:58:15,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:15,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200791392] [2022-12-13 10:58:15,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200791392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:58:15,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:58:15,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:58:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797369150] [2022-12-13 10:58:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:58:15,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:58:15,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:15,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:58:15,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:58:15,253 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-12-13 10:58:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:15,301 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2022-12-13 10:58:15,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:58:15,302 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-12-13 10:58:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:15,303 INFO L225 Difference]: With dead ends: 86 [2022-12-13 10:58:15,303 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 10:58:15,303 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-12-13 10:58:15,304 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-12-13 10:58:15,304 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-12-13 10:58:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 10:58:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-12-13 10:58:15,310 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-12-13 10:58:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-12-13 10:58:15,311 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2022-12-13 10:58:15,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:15,311 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-12-13 10:58:15,311 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-12-13 10:58:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-12-13 10:58:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 10:58:15,312 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:15,312 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-12-13 10:58:15,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:58:15,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2022-12-13 10:58:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:15,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123100360] [2022-12-13 10:58:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 10:58:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:15,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 10:58:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:58:15,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:15,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123100360] [2022-12-13 10:58:15,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123100360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:58:15,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457893402] [2022-12-13 10:58:15,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:15,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 10:58:15,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:58:15,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 10:58:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:15,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:58:15,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:58:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:58:15,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:58:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:58:15,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457893402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:58:15,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:58:15,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 10:58:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355981129] [2022-12-13 10:58:15,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:58:15,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 10:58:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:15,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 10:58:15,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-13 10:58:15,790 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-12-13 10:58:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:16,026 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2022-12-13 10:58:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:58:16,026 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-12-13 10:58:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:16,028 INFO L225 Difference]: With dead ends: 118 [2022-12-13 10:58:16,028 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 10:58:16,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-12-13 10:58:16,030 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 132 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 10:58:16,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 338 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 10:58:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 10:58:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2022-12-13 10:58:16,037 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-12-13 10:58:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-12-13 10:58:16,038 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2022-12-13 10:58:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:16,038 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-12-13 10:58:16,039 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-12-13 10:58:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-12-13 10:58:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 10:58:16,039 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:16,039 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-12-13 10:58:16,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 10:58:16,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:16,242 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:16,244 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2022-12-13 10:58:16,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:16,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733875850] [2022-12-13 10:58:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:16,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:16,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 10:58:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 10:58:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 10:58:16,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:16,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733875850] [2022-12-13 10:58:16,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733875850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:58:16,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:58:16,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:58:16,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158889658] [2022-12-13 10:58:16,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:58:16,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:58:16,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:16,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:58:16,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:58:16,458 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-12-13 10:58:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:16,515 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2022-12-13 10:58:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:58:16,516 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-12-13 10:58:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:16,516 INFO L225 Difference]: With dead ends: 75 [2022-12-13 10:58:16,516 INFO L226 Difference]: Without dead ends: 73 [2022-12-13 10:58:16,517 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-12-13 10:58:16,517 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 10:58:16,518 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.0s Time] [2022-12-13 10:58:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-13 10:58:16,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-12-13 10:58:16,525 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-12-13 10:58:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2022-12-13 10:58:16,526 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2022-12-13 10:58:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:16,526 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2022-12-13 10:58:16,526 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-12-13 10:58:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-12-13 10:58:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 10:58:16,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:16,527 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-12-13 10:58:16,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:58:16,528 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:16,528 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2022-12-13 10:58:16,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:16,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081974624] [2022-12-13 10:58:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:16,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 10:58:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 10:58:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 10:58:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:16,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081974624] [2022-12-13 10:58:16,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081974624] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:58:16,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623322891] [2022-12-13 10:58:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:16,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:16,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 10:58:16,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:58:16,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 10:58:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:16,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 10:58:16,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:58:16,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:16,821 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-12-13 10:58:16,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:16,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-12-13 10:58:16,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:16,838 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-12-13 10:58:16,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:16,848 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-12-13 10:58:16,976 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-12-13 10:58:16,982 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-12-13 10:58:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 10:58:16,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:58:17,048 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-12-13 10:58:17,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:17,149 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-12-13 10:58:17,154 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-12-13 10:58:17,158 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-12-13 10:58:17,164 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 10:58:17,165 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-12-13 10:58:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 10:58:17,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623322891] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:58:17,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:58:17,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2022-12-13 10:58:17,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197650276] [2022-12-13 10:58:17,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:58:17,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 10:58:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:17,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 10:58:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-12-13 10:58:17,194 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-12-13 10:58:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:18,186 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2022-12-13 10:58:18,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 10:58:18,186 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-12-13 10:58:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:18,189 INFO L225 Difference]: With dead ends: 326 [2022-12-13 10:58:18,189 INFO L226 Difference]: Without dead ends: 253 [2022-12-13 10:58:18,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2022-12-13 10:58:18,190 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 243 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 10:58:18,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 852 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 10:58:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-13 10:58:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 136. [2022-12-13 10:58:18,213 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-12-13 10:58:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2022-12-13 10:58:18,214 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 37 [2022-12-13 10:58:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:18,214 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2022-12-13 10:58:18,214 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-12-13 10:58:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2022-12-13 10:58:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 10:58:18,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:18,216 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-12-13 10:58:18,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 10:58:18,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 10:58:18,418 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:18,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2022-12-13 10:58:18,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:18,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094314222] [2022-12-13 10:58:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 10:58:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 10:58:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 10:58:18,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:18,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094314222] [2022-12-13 10:58:18,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094314222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:58:18,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:58:18,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:58:18,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318112418] [2022-12-13 10:58:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:58:18,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:58:18,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:18,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:58:18,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:58:18,690 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-12-13 10:58:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:18,789 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2022-12-13 10:58:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:58:18,790 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-12-13 10:58:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:18,791 INFO L225 Difference]: With dead ends: 179 [2022-12-13 10:58:18,791 INFO L226 Difference]: Without dead ends: 148 [2022-12-13 10:58:18,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:58:18,792 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-12-13 10:58:18,792 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-12-13 10:58:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-12-13 10:58:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2022-12-13 10:58:18,805 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-12-13 10:58:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2022-12-13 10:58:18,807 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 35 [2022-12-13 10:58:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:18,807 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2022-12-13 10:58:18,807 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-12-13 10:58:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2022-12-13 10:58:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 10:58:18,808 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:18,808 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-12-13 10:58:18,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:58:18,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:18,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2022-12-13 10:58:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:18,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839347324] [2022-12-13 10:58:18,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:18,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:18,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 10:58:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:18,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 10:58:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:58:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839347324] [2022-12-13 10:58:18,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839347324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:58:18,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:58:18,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:58:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072800151] [2022-12-13 10:58:18,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:58:18,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:58:18,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:58:18,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:58:18,883 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-12-13 10:58:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:18,920 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2022-12-13 10:58:18,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:58:18,921 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-12-13 10:58:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:18,922 INFO L225 Difference]: With dead ends: 150 [2022-12-13 10:58:18,922 INFO L226 Difference]: Without dead ends: 138 [2022-12-13 10:58:18,922 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-12-13 10:58:18,922 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-12-13 10:58:18,923 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-12-13 10:58:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-13 10:58:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2022-12-13 10:58:18,934 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-12-13 10:58:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2022-12-13 10:58:18,935 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 35 [2022-12-13 10:58:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:18,935 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2022-12-13 10:58:18,935 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-12-13 10:58:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2022-12-13 10:58:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 10:58:18,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:18,936 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-12-13 10:58:18,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 10:58:18,936 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2022-12-13 10:58:18,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:18,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290917983] [2022-12-13 10:58:18,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:18,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:18,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:18,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 10:58:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:19,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 10:58:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:58:19,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:19,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290917983] [2022-12-13 10:58:19,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290917983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:58:19,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:58:19,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:58:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215933108] [2022-12-13 10:58:19,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:58:19,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:58:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:19,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:58:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:58:19,030 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-12-13 10:58:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:19,089 INFO L93 Difference]: Finished difference Result 202 states and 267 transitions. [2022-12-13 10:58:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:58:19,090 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-12-13 10:58:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:19,090 INFO L225 Difference]: With dead ends: 202 [2022-12-13 10:58:19,091 INFO L226 Difference]: Without dead ends: 94 [2022-12-13 10:58:19,091 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-12-13 10:58:19,092 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 10:58:19,092 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.0s Time] [2022-12-13 10:58:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-13 10:58:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-12-13 10:58:19,100 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-12-13 10:58:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2022-12-13 10:58:19,100 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 36 [2022-12-13 10:58:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:19,101 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2022-12-13 10:58:19,101 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-12-13 10:58:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2022-12-13 10:58:19,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 10:58:19,101 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:19,101 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-12-13 10:58:19,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 10:58:19,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1426728412, now seen corresponding path program 1 times [2022-12-13 10:58:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:19,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116240726] [2022-12-13 10:58:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 10:58:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 10:58:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 10:58:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:19,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116240726] [2022-12-13 10:58:19,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116240726] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:58:19,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481833500] [2022-12-13 10:58:19,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:19,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:19,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 10:58:19,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:58:19,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 10:58:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:19,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 10:58:19,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:58:19,555 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-12-13 10:58:19,601 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 10:58:19,601 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-12-13 10:58:19,644 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-12-13 10:58:19,644 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-12-13 10:58:19,651 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-12-13 10:58:19,664 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-12-13 10:58:19,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 10:58:19,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 10:58:19,695 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-12-13 10:58:19,698 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-12-13 10:58:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 10:58:19,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:58:19,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:19,969 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-12-13 10:58:19,973 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-12-13 10:58:19,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 128 treesize of output 124 [2022-12-13 10:58:20,024 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-12-13 10:58:20,031 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-12-13 10:58:20,036 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 10:58:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 10:58:20,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481833500] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:58:20,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:58:20,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 25 [2022-12-13 10:58:20,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756677523] [2022-12-13 10:58:20,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:58:20,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 10:58:20,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:20,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 10:58:20,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-12-13 10:58:20,169 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-12-13 10:58:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:21,054 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2022-12-13 10:58:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 10:58:21,055 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-12-13 10:58:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:21,056 INFO L225 Difference]: With dead ends: 185 [2022-12-13 10:58:21,056 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 10:58:21,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=448, Invalid=1808, Unknown=0, NotChecked=0, Total=2256 [2022-12-13 10:58:21,058 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 277 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 10:58:21,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 440 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 10:58:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 10:58:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-12-13 10:58:21,069 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-12-13 10:58:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2022-12-13 10:58:21,069 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 46 [2022-12-13 10:58:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:21,070 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2022-12-13 10:58:21,070 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-12-13 10:58:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-12-13 10:58:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 10:58:21,070 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:21,070 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-12-13 10:58:21,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 10:58:21,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 10:58:21,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash 803799756, now seen corresponding path program 1 times [2022-12-13 10:58:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:21,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590321691] [2022-12-13 10:58:21,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:21,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 10:58:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:21,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:21,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 10:58:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:21,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 10:58:21,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:21,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590321691] [2022-12-13 10:58:21,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590321691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:58:21,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410917985] [2022-12-13 10:58:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:21,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:21,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 10:58:21,962 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:58:21,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 10:58:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:22,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-13 10:58:22,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:58:22,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:22,133 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-12-13 10:58:22,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:22,137 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-12-13 10:58:22,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:22,144 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-12-13 10:58:22,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:22,148 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-12-13 10:58:22,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:22,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 10:58:22,490 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 10:58:22,490 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-12-13 10:58:22,495 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-12-13 10:58:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 10:58:22,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:58:22,956 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-12-13 10:58:23,133 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-12-13 10:58:23,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:23,364 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-12-13 10:58:23,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:23,371 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-12-13 10:58:23,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:23,396 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-12-13 10:58:23,408 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-12-13 10:58:23,420 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-12-13 10:58:23,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:23,440 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-12-13 10:58:24,094 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-12-13 10:58:24,099 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-12-13 10:58:24,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 10:58:24,114 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-12-13 10:58:24,132 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-12-13 10:58:24,143 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-12-13 10:58:24,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:24,255 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-12-13 10:58:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 10:58:24,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410917985] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:58:24,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:58:24,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2022-12-13 10:58:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053558988] [2022-12-13 10:58:24,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:58:24,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 10:58:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:24,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 10:58:24,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1497, Unknown=0, NotChecked=0, Total=1640 [2022-12-13 10:58:24,456 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-12-13 10:58:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:26,925 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2022-12-13 10:58:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 10:58:26,926 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-12-13 10:58:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:26,927 INFO L225 Difference]: With dead ends: 184 [2022-12-13 10:58:26,927 INFO L226 Difference]: Without dead ends: 123 [2022-12-13 10:58:26,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=563, Invalid=4129, Unknown=0, NotChecked=0, Total=4692 [2022-12-13 10:58:26,929 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 235 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 10:58:26,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 804 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 10:58:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-13 10:58:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2022-12-13 10:58:26,939 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-12-13 10:58:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2022-12-13 10:58:26,939 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 43 [2022-12-13 10:58:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:26,940 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2022-12-13 10:58:26,940 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-12-13 10:58:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2022-12-13 10:58:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 10:58:26,940 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:26,940 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-12-13 10:58:26,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 10:58:27,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 10:58:27,143 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash 828672736, now seen corresponding path program 1 times [2022-12-13 10:58:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:27,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839015065] [2022-12-13 10:58:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 10:58:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 10:58:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 10:58:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:27,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839015065] [2022-12-13 10:58:27,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839015065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:58:27,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:58:27,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:58:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863290170] [2022-12-13 10:58:27,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:58:27,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:58:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:58:27,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:58:27,300 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-12-13 10:58:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:27,363 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2022-12-13 10:58:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:58:27,364 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-12-13 10:58:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:27,365 INFO L225 Difference]: With dead ends: 137 [2022-12-13 10:58:27,365 INFO L226 Difference]: Without dead ends: 135 [2022-12-13 10:58:27,366 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-12-13 10:58:27,366 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-12-13 10:58:27,366 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-12-13 10:58:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-12-13 10:58:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 110. [2022-12-13 10:58:27,377 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-12-13 10:58:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 139 transitions. [2022-12-13 10:58:27,378 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 139 transitions. Word has length 44 [2022-12-13 10:58:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:27,378 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 139 transitions. [2022-12-13 10:58:27,378 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-12-13 10:58:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 139 transitions. [2022-12-13 10:58:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 10:58:27,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:27,379 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-12-13 10:58:27,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 10:58:27,379 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash 191887930, now seen corresponding path program 1 times [2022-12-13 10:58:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:27,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991017907] [2022-12-13 10:58:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:27,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 10:58:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 10:58:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 10:58:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:27,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991017907] [2022-12-13 10:58:27,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991017907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:58:27,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416806361] [2022-12-13 10:58:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:27,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:27,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 10:58:27,501 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:58:27,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 10:58:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:27,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 10:58:27,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:58:27,637 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-12-13 10:58:27,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:27,653 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-12-13 10:58:27,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:27,656 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-12-13 10:58:27,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:27,662 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-12-13 10:58:27,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:27,666 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-12-13 10:58:27,718 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 10:58:27,718 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-12-13 10:58:27,754 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-12-13 10:58:27,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:27,768 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:58:27,768 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-12-13 10:58:27,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:27,782 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:58:27,782 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-12-13 10:58:27,905 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-12-13 10:58:27,907 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-12-13 10:58:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 10:58:27,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:58:27,962 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-12-13 10:58:28,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:28,298 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-12-13 10:58:28,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:28,307 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-12-13 10:58:28,314 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-12-13 10:58:28,321 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-12-13 10:58:28,350 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-12-13 10:58:28,437 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-12-13 10:58:28,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:28,553 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-12-13 10:58:28,557 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-12-13 10:58:28,564 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-12-13 10:58:28,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 166 treesize of output 154 [2022-12-13 10:58:28,570 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-12-13 10:58:28,634 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-12-13 10:58:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 10:58:28,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416806361] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:58:28,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:58:28,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2022-12-13 10:58:28,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107253922] [2022-12-13 10:58:28,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:58:28,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 10:58:28,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:28,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 10:58:28,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=360, Unknown=3, NotChecked=0, Total=420 [2022-12-13 10:58:28,653 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-12-13 10:58:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:29,416 INFO L93 Difference]: Finished difference Result 226 states and 281 transitions. [2022-12-13 10:58:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 10:58:29,417 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-12-13 10:58:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:29,417 INFO L225 Difference]: With dead ends: 226 [2022-12-13 10:58:29,418 INFO L226 Difference]: Without dead ends: 134 [2022-12-13 10:58:29,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=1021, Unknown=3, NotChecked=0, Total=1332 [2022-12-13 10:58:29,418 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 119 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 10:58:29,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 599 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 10:58:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-12-13 10:58:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 84. [2022-12-13 10:58:29,428 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-12-13 10:58:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-12-13 10:58:29,428 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 47 [2022-12-13 10:58:29,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:29,428 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-12-13 10:58:29,428 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-12-13 10:58:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-12-13 10:58:29,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 10:58:29,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:29,429 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-12-13 10:58:29,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 10:58:29,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 10:58:29,631 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1865771786, now seen corresponding path program 1 times [2022-12-13 10:58:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:29,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452296399] [2022-12-13 10:58:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:29,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 10:58:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 10:58:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:29,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 10:58:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 10:58:29,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:29,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452296399] [2022-12-13 10:58:29,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452296399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:58:29,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489948600] [2022-12-13 10:58:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:29,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:29,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 10:58:29,783 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:58:29,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 10:58:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:29,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 10:58:29,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:58:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 10:58:29,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:58:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 10:58:29,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489948600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:58:29,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:58:29,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 10:58:29,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855625401] [2022-12-13 10:58:29,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:58:29,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:58:29,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:58:29,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:58:29,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:58:29,943 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-12-13 10:58:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 10:58:30,079 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2022-12-13 10:58:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:58:30,080 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-12-13 10:58:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 10:58:30,080 INFO L225 Difference]: With dead ends: 142 [2022-12-13 10:58:30,081 INFO L226 Difference]: Without dead ends: 91 [2022-12-13 10:58:30,081 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-12-13 10:58:30,082 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 97 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 10:58:30,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 169 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 10:58:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-13 10:58:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-12-13 10:58:30,094 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-12-13 10:58:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2022-12-13 10:58:30,095 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 46 [2022-12-13 10:58:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 10:58:30,095 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2022-12-13 10:58:30,096 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-12-13 10:58:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-12-13 10:58:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 10:58:30,096 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 10:58:30,097 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-12-13 10:58:30,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 10:58:30,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:30,298 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 10:58:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:30,299 INFO L85 PathProgramCache]: Analyzing trace with hash 604583819, now seen corresponding path program 2 times [2022-12-13 10:58:30,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:30,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778714045] [2022-12-13 10:58:30,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:30,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 10:58:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 10:58:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:30,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 10:58:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 10:58:30,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:30,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778714045] [2022-12-13 10:58:30,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778714045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:58:30,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777600961] [2022-12-13 10:58:30,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:58:30,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:30,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 10:58:30,837 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:58:30,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 10:58:30,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:58:30,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:58:30,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 87 conjunts are in the unsatisfiable core [2022-12-13 10:58:30,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:58:30,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:30,984 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-12-13 10:58:30,992 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:58:30,992 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-12-13 10:58:30,995 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-12-13 10:58:31,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:31,001 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-12-13 10:58:31,012 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:58:31,012 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-12-13 10:58:31,018 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-12-13 10:58:31,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:31,244 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-12-13 10:58:31,244 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-12-13 10:58:31,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:58:31,269 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2022-12-13 10:58:31,269 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-12-13 10:58:49,901 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-12-13 10:59:02,026 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-12-13 10:59:10,166 WARN L233 SmtUtils]: Spent 8.02s 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-12-13 10:59:20,308 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-12-13 10:59:28,439 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-12-13 10:59:36,665 WARN L233 SmtUtils]: Spent 8.02s 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-12-13 10:59:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 10:59:36,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:59:37,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777600961] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:59:37,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 10:59:37,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 33 [2022-12-13 10:59:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920214950] [2022-12-13 10:59:37,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 10:59:37,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 10:59:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:59:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 10:59:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=996, Unknown=8, NotChecked=0, Total=1122 [2022-12-13 10:59:37,037 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-12-13 10:59:39,839 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-12-13 10:59:44,001 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-12-13 10:59:46,011 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-12-13 10:59:48,016 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-12-13 10:59:50,022 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-12-13 10:59:52,035 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-12-13 10:59:54,055 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-12-13 10:59:56,074 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-12-13 11:00:04,215 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-12-13 11:00:06,226 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-12-13 11:00:08,253 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-12-13 11:00:10,256 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-12-13 11:00:20,314 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-12-13 11:00:22,338 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-12-13 11:00:30,391 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-12-13 11:00:48,502 WARN L233 SmtUtils]: Spent 16.07s 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-12-13 11:00:50,508 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-12-13 11:00:54,684 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-12-13 11:00:56,785 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-12-13 11:00:58,862 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-12-13 11:01:00,923 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-12-13 11:01:02,978 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-12-13 11:01:05,008 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-12-13 11:01:07,032 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-12-13 11:01:09,073 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-12-13 11:01:11,105 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-12-13 11:01:13,110 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-12-13 11:01:15,132 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-12-13 11:01:17,143 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-12-13 11:01:19,148 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-12-13 11:01:21,211 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-12-13 11:01:23,248 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-12-13 11:01:25,254 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-12-13 11:01:27,259 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-12-13 11:01:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:01:27,263 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2022-12-13 11:01:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:01:27,264 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-12-13 11:01:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:01:27,264 INFO L225 Difference]: With dead ends: 155 [2022-12-13 11:01:27,265 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 11:01:27,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 112.9s TimeCoverageRelationStatistics Valid=360, Invalid=2381, Unknown=15, NotChecked=0, Total=2756 [2022-12-13 11:01:27,266 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 163 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 64 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:01:27,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 430 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 547 Invalid, 31 Unknown, 0 Unchecked, 62.9s Time] [2022-12-13 11:01:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 11:01:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2022-12-13 11:01:27,275 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-12-13 11:01:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2022-12-13 11:01:27,275 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 50 [2022-12-13 11:01:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:01:27,276 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2022-12-13 11:01:27,276 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-12-13 11:01:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2022-12-13 11:01:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 11:01:27,277 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:01:27,277 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-12-13 11:01:27,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 11:01:27,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:01:27,479 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:01:27,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:01:27,480 INFO L85 PathProgramCache]: Analyzing trace with hash -664222695, now seen corresponding path program 1 times [2022-12-13 11:01:27,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:01:27,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203600928] [2022-12-13 11:01:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:01:27,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:01:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:27,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:01:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:28,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:01:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:28,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:01:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:28,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:01:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:01:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 11:01:28,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:01:28,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203600928] [2022-12-13 11:01:28,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203600928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:01:28,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172326073] [2022-12-13 11:01:28,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:01:28,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:01:28,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:01:28,024 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:01:28,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 11:01:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:28,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 11:01:28,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:01:28,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:28,166 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-12-13 11:01:28,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:28,170 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-12-13 11:01:28,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:28,174 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-12-13 11:01:28,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:28,177 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-12-13 11:01:28,438 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:01:28,439 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-12-13 11:01:28,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:28,444 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-12-13 11:01:28,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:28,684 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-12-13 11:01:28,686 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-12-13 11:01:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 11:01:28,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:01:28,773 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-12-13 11:01:28,784 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#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-12-13 11:01:28,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172326073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:01:28,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:01:28,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2022-12-13 11:01:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803768215] [2022-12-13 11:01:28,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:01:28,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 11:01:28,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:01:28,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 11:01:28,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=402, Unknown=2, NotChecked=82, Total=552 [2022-12-13 11:01:28,800 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-12-13 11:01:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:01:30,011 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2022-12-13 11:01:30,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 11:01:30,011 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-12-13 11:01:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:01:30,012 INFO L225 Difference]: With dead ends: 124 [2022-12-13 11:01:30,012 INFO L226 Difference]: Without dead ends: 104 [2022-12-13 11:01:30,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=350, Invalid=1296, Unknown=2, NotChecked=158, Total=1806 [2022-12-13 11:01:30,013 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 312 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:01:30,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 293 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:01:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-13 11:01:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 69. [2022-12-13 11:01:30,022 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-12-13 11:01:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-12-13 11:01:30,023 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 53 [2022-12-13 11:01:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:01:30,023 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-12-13 11:01:30,023 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-12-13 11:01:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-12-13 11:01:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 11:01:30,023 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:01:30,023 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-12-13 11:01:30,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 11:01:30,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 11:01:30,225 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:01:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:01:30,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1675339945, now seen corresponding path program 1 times [2022-12-13 11:01:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:01:30,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235719158] [2022-12-13 11:01:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:01:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:01:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:01:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:01:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:01:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:01:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:30,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:01:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 11:01:30,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:01:30,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235719158] [2022-12-13 11:01:30,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235719158] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:01:30,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713396913] [2022-12-13 11:01:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:01:30,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:01:30,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:01:30,714 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:01:30,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 11:01:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:30,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-13 11:01:30,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:01:30,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:30,880 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-12-13 11:01:30,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:30,884 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-12-13 11:01:30,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:30,892 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-12-13 11:01:30,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:30,896 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-12-13 11:01:31,435 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:01:31,436 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-12-13 11:01:31,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:31,442 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-12-13 11:01:32,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:32,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:32,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:01:32,108 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 11:01:32,108 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-12-13 11:01:32,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:32,113 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-12-13 11:01:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 11:01:32,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:01:33,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713396913] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:01:33,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:01:33,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2022-12-13 11:01:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859451293] [2022-12-13 11:01:33,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:01:33,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 11:01:33,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:01:33,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 11:01:33,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1473, Unknown=1, NotChecked=0, Total=1640 [2022-12-13 11:01:33,012 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-12-13 11:01:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:01:34,751 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-12-13 11:01:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:01:34,751 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-12-13 11:01:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:01:34,752 INFO L225 Difference]: With dead ends: 83 [2022-12-13 11:01:34,752 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 11:01:34,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=549, Invalid=3356, Unknown=1, NotChecked=0, Total=3906 [2022-12-13 11:01:34,755 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 164 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:01:34,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 360 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 11:01:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 11:01:34,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2022-12-13 11:01:34,765 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-12-13 11:01:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-12-13 11:01:34,766 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 53 [2022-12-13 11:01:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:01:34,766 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-12-13 11:01:34,766 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-12-13 11:01:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-12-13 11:01:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 11:01:34,767 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:01:34,767 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-12-13 11:01:34,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 11:01:34,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 11:01:34,969 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:01:34,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:01:34,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1417174507, now seen corresponding path program 1 times [2022-12-13 11:01:34,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:01:34,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440876317] [2022-12-13 11:01:34,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:01:34,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:01:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:35,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:01:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:01:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:35,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:01:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:01:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:01:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 11:01:35,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:01:35,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440876317] [2022-12-13 11:01:35,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440876317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:01:35,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892111946] [2022-12-13 11:01:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:01:35,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:01:35,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:01:35,205 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:01:35,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 11:01:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:35,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-13 11:01:35,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:01:35,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:35,383 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-12-13 11:01:35,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:35,386 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-12-13 11:01:35,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:35,391 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-12-13 11:01:35,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:35,395 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-12-13 11:01:35,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:35,662 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-12-13 11:01:35,708 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:01:35,708 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-12-13 11:01:35,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:35,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:01:35,968 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-12-13 11:01:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 11:01:35,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:01:36,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892111946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:01:36,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:01:36,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2022-12-13 11:01:36,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390459862] [2022-12-13 11:01:36,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:01:36,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 11:01:36,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:01:36,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 11:01:36,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-12-13 11:01:36,136 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-12-13 11:01:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:01:37,135 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-12-13 11:01:37,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:01:37,135 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-12-13 11:01:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:01:37,136 INFO L225 Difference]: With dead ends: 81 [2022-12-13 11:01:37,136 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 11:01:37,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=1048, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 11:01:37,136 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 184 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:01:37,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 234 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:01:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 11:01:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-12-13 11:01:37,147 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-12-13 11:01:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-12-13 11:01:37,147 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 53 [2022-12-13 11:01:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:01:37,147 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-12-13 11:01:37,148 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-12-13 11:01:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-12-13 11:01:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 11:01:37,148 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:01:37,148 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-12-13 11:01:37,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 11:01:37,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 11:01:37,350 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:01:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:01:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash -160259518, now seen corresponding path program 2 times [2022-12-13 11:01:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:01:37,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176536650] [2022-12-13 11:01:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:01:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:01:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:01:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:01:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:01:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:01:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:01:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:01:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 11:01:37,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:01:37,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176536650] [2022-12-13 11:01:37,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176536650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:01:37,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:01:37,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:01:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235679584] [2022-12-13 11:01:37,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:01:37,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:01:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:01:37,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:01:37,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:01:37,461 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-12-13 11:01:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:01:37,503 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-12-13 11:01:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:01:37,504 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-12-13 11:01:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:01:37,504 INFO L225 Difference]: With dead ends: 77 [2022-12-13 11:01:37,504 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 11:01:37,504 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-12-13 11:01:37,505 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-12-13 11:01:37,505 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-12-13 11:01:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 11:01:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-12-13 11:01:37,515 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-12-13 11:01:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-12-13 11:01:37,516 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 59 [2022-12-13 11:01:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:01:37,516 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-12-13 11:01:37,516 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-12-13 11:01:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-12-13 11:01:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 11:01:37,516 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:01:37,516 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-12-13 11:01:37,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 11:01:37,517 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:01:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:01:37,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1055504788, now seen corresponding path program 3 times [2022-12-13 11:01:37,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:01:37,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257887616] [2022-12-13 11:01:37,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:01:37,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:01:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:01:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:01:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:01:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:01:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:37,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:01:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:38,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:01:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:01:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 11:01:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:01:38,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257887616] [2022-12-13 11:01:38,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257887616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:01:38,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219994238] [2022-12-13 11:01:38,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 11:01:38,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:01:38,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:01:38,066 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:01:38,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 11:01:38,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 11:01:38,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:01:38,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 133 conjunts are in the unsatisfiable core [2022-12-13 11:01:38,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:01:38,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:38,282 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-12-13 11:01:38,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:38,286 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-12-13 11:01:38,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:38,293 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-12-13 11:01:38,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:38,710 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-13 11:01:38,711 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-12-13 11:01:38,721 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 11:01:38,722 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-12-13 11:01:38,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:01:38,731 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-12-13 11:01:38,738 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-12-13 11:01:38,743 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-12-13 11:01:40,862 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-12-13 11:01:50,977 WARN L233 SmtUtils]: Spent 6.04s 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-12-13 11:01:57,098 WARN L233 SmtUtils]: Spent 6.06s 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-12-13 11:02:03,186 WARN L233 SmtUtils]: Spent 6.03s 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-12-13 11:02:03,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:02:03,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:02:03,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:02:03,670 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-13 11:02:03,671 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-12-13 11:02:03,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:02:03,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:02:03,677 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-12-13 11:02:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-12-13 11:02:04,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:02:19,950 WARN L233 SmtUtils]: Spent 10.05s 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-12-13 11:02:30,107 WARN L233 SmtUtils]: Spent 10.05s 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-12-13 11:02:40,258 WARN L233 SmtUtils]: Spent 10.05s 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-12-13 11:02:41,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219994238] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:02:41,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:02:41,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28] total 41 [2022-12-13 11:02:41,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930755495] [2022-12-13 11:02:41,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:02:41,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 11:02:41,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:02:41,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 11:02:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2414, Unknown=18, NotChecked=100, Total=2756 [2022-12-13 11:02:41,068 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-12-13 11:02:51,895 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-12-13 11:03:00,010 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-12-13 11:03:08,115 WARN L233 SmtUtils]: Spent 8.04s 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-12-13 11:03:14,237 WARN L233 SmtUtils]: Spent 6.04s 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-12-13 11:03:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:03:17,000 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-12-13 11:03:17,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 11:03:17,001 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-12-13 11:03:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:03:17,001 INFO L225 Difference]: With dead ends: 91 [2022-12-13 11:03:17,001 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 11:03:17,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 95.8s TimeCoverageRelationStatistics Valid=978, Invalid=6840, Unknown=18, NotChecked=174, Total=8010 [2022-12-13 11:03:17,003 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 257 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:03:17,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 536 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1065 Invalid, 0 Unknown, 72 Unchecked, 1.8s Time] [2022-12-13 11:03:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 11:03:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 11:03:17,004 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-12-13 11:03:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 11:03:17,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2022-12-13 11:03:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:03:17,004 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 11:03:17,004 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-12-13 11:03:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 11:03:17,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 11:03:17,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 11:03:17,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 11:03:17,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:03:17,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 11:03:53,066 WARN L233 SmtUtils]: Spent 31.86s 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-12-13 11:03:54,224 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-12-13 11:03:54,225 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-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point L622-2(line 622) no Hoare annotation was computed. [2022-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point L618(line 618) no Hoare annotation was computed. [2022-12-13 11:03:54,225 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 601 624) the Hoare annotation is: true [2022-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 582) no Hoare annotation was computed. [2022-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point L3(line 3) no Hoare annotation was computed. [2022-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point L581-2(lines 581 582) no Hoare annotation was computed. [2022-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 611) no Hoare annotation was computed. [2022-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 591) no Hoare annotation was computed. [2022-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 592) no Hoare annotation was computed. [2022-12-13 11:03:54,225 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 616) no Hoare annotation was computed. [2022-12-13 11:03:54,226 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-12-13 11:03:54,226 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 11:03:54,226 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-12-13 11:03:54,226 INFO L899 garLoopResultBuilder]: For program point L620(line 620) no Hoare annotation was computed. [2022-12-13 11:03:54,226 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-12-13 11:03:54,226 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 11:03:54,226 INFO L899 garLoopResultBuilder]: For program point L620-3(line 620) no Hoare annotation was computed. [2022-12-13 11:03:54,226 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-12-13 11:03:54,226 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 584) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point L620-5(line 620) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 585) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point L588(lines 588 589) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point L588-2(lines 588 589) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point L2(lines 2 4) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 593 600) the Hoare annotation is: true [2022-12-13 11:03:54,227 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-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xFINAL(lines 593 600) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 598) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point L598-1(line 598) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 596) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xEXIT(lines 593 600) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 23) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 23) no Hoare annotation was computed. [2022-12-13 11:03:54,227 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 18 23) the Hoare annotation is: true [2022-12-13 11:03:54,228 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-12-13 11:03:54,228 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 21) no Hoare annotation was computed. [2022-12-13 11:03:54,228 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-12-13 11:03:54,230 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:03:54,231 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:03:54,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,242 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,245 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-12-13 11:03:54,245 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-12-13 11:03:54,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,245 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-12-13 11:03:54,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,247 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-12-13 11:03:54,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,247 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-12-13 11:03:54,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,247 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-12-13 11:03:54,247 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-12-13 11:03:54,247 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-12-13 11:03:54,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,247 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-12-13 11:03:54,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,247 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-12-13 11:03:54,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,248 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-12-13 11:03:54,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,253 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,258 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-12-13 11:03:54,258 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-12-13 11:03:54,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,258 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-12-13 11:03:54,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,259 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-12-13 11:03:54,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,259 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-12-13 11:03:54,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,259 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-12-13 11:03:54,259 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-12-13 11:03:54,259 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-12-13 11:03:54,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,259 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-12-13 11:03:54,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,260 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-12-13 11:03:54,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,260 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-12-13 11:03:54,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:03:54 BoogieIcfgContainer [2022-12-13 11:03:54,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:03:54,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 11:03:54,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 11:03:54,263 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 11:03:54,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:58:14" (3/4) ... [2022-12-13 11:03:54,266 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 11:03:54,270 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2022-12-13 11:03:54,270 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-12-13 11:03:54,273 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-12-13 11:03:54,273 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 11:03:54,273 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 11:03:54,274 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 11:03:54,289 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-12-13 11:03:54,297 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 11:03:54,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 11:03:54,297 INFO L158 Benchmark]: Toolchain (without parser) took 340518.87ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 110.2MB in the beginning and 109.1MB in the end (delta: 1.2MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2022-12-13 11:03:54,297 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:03:54,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.34ms. Allocated memory is still 148.9MB. Free memory was 110.2MB in the beginning and 93.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 11:03:54,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.12ms. Allocated memory is still 148.9MB. Free memory was 93.1MB in the beginning and 91.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:03:54,298 INFO L158 Benchmark]: Boogie Preprocessor took 29.06ms. Allocated memory is still 148.9MB. Free memory was 91.0MB in the beginning and 89.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:03:54,298 INFO L158 Benchmark]: RCFGBuilder took 393.89ms. Allocated memory is still 148.9MB. Free memory was 89.3MB in the beginning and 119.4MB in the end (delta: -30.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2022-12-13 11:03:54,298 INFO L158 Benchmark]: TraceAbstraction took 339686.74ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 118.4MB in the beginning and 112.2MB in the end (delta: 6.2MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. [2022-12-13 11:03:54,298 INFO L158 Benchmark]: Witness Printer took 33.80ms. Allocated memory is still 218.1MB. Free memory was 112.2MB in the beginning and 109.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 11:03:54,299 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.20ms. Allocated memory is still 100.7MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.34ms. Allocated memory is still 148.9MB. Free memory was 110.2MB in the beginning and 93.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.12ms. Allocated memory is still 148.9MB. Free memory was 93.1MB in the beginning and 91.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.06ms. Allocated memory is still 148.9MB. Free memory was 91.0MB in the beginning and 89.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 393.89ms. Allocated memory is still 148.9MB. Free memory was 89.3MB in the beginning and 119.4MB in the end (delta: -30.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 339686.74ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 118.4MB in the beginning and 112.2MB in the end (delta: 6.2MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. * Witness Printer took 33.80ms. Allocated memory is still 218.1MB. Free memory was 112.2MB in the beginning and 109.1MB in the end (delta: 3.1MB). 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: 339.6s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 156.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 37.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 2273 SdHoareTripleChecker+Valid, 68.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2263 mSDsluCounter, 6825 SdHoareTripleChecker+Invalid, 68.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 72 IncrementalHoareTripleChecker+Unchecked, 5837 mSDsCounter, 959 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6360 IncrementalHoareTripleChecker+Invalid, 7422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 959 mSolverCounterUnsat, 988 mSDtfsCounter, 6360 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1446 GetRequests, 896 SyntacticMatches, 18 SemanticMatches, 532 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5326 ImplicationChecksByTransitivity, 218.2s 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.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 370 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 181 PreInvPairs, 199 NumberOfFragments, 1991 HoareAnnotationTreeSize, 181 FomulaSimplifications, 1444 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 164735 FormulaSimplificationTreeSizeReductionInter, 35.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 141.8s 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-12-13 11:03:54,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,312 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-12-13 11:03:54,312 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-12-13 11:03:54,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,312 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-12-13 11:03:54,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,314 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-12-13 11:03:54,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,314 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-12-13 11:03:54,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,314 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-12-13 11:03:54,315 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-12-13 11:03:54,315 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-12-13 11:03:54,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,315 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-12-13 11:03:54,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,315 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-12-13 11:03:54,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,315 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-12-13 11:03:54,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,326 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-12-13 11:03:54,326 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-12-13 11:03:54,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,326 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-12-13 11:03:54,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,327 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-12-13 11:03:54,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,328 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-12-13 11:03:54,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,328 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-12-13 11:03:54,328 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-12-13 11:03:54,328 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-12-13 11:03:54,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,328 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-12-13 11:03:54,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 11:03:54,329 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-12-13 11:03:54,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,329 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-12-13 11:03:54,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 11:03:54,329 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-12-13 11:03:54,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d1b8b7-10fd-48f5-abfd-0da905784058/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE