./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/calendar.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_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/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_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/calendar.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/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_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/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 fe08ef78ee5c945bc38e9e915e26405aefe9ffb2d4911c91347e07e6a879dcd5 --- 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 13:57:32,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:57:32,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:57:32,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:57:32,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:57:32,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:57:32,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:57:32,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:57:32,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:57:32,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:57:32,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:57:32,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:57:32,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:57:32,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:57:32,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:57:32,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:57:32,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:57:32,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:57:32,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:57:32,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:57:32,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:57:32,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:57:32,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:57:32,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:57:32,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:57:32,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:57:32,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:57:32,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:57:32,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:57:32,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:57:32,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:57:32,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:57:32,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:57:32,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:57:32,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:57:32,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:57:32,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:57:32,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:57:32,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:57:32,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:57:32,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:57:32,536 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:57:32,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:57:32,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:57:32,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:57:32,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:57:32,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:57:32,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:57:32,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:57:32,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:57:32,551 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:57:32,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:57:32,552 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:57:32,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:57:32,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:57:32,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:57:32,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:57:32,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:57:32,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:57:32,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:57:32,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:57:32,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:57:32,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:57:32,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:57:32,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:57:32,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:57:32,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:57:32,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:57:32,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:57:32,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:57:32,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:57:32,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:57:32,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:57:32,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:57:32,554 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:57:32,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:57:32,554 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:57:32,554 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_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/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_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/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 -> fe08ef78ee5c945bc38e9e915e26405aefe9ffb2d4911c91347e07e6a879dcd5 [2022-12-13 13:57:32,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:57:32,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:57:32,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:57:32,754 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:57:32,755 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:57:32,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/heap-data/calendar.i [2022-12-13 13:57:35,426 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:57:35,643 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:57:35,644 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/sv-benchmarks/c/heap-data/calendar.i [2022-12-13 13:57:35,656 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/data/164fdf2be/9b04f3f2e0c943e59fc43168251bef38/FLAG2454627c6 [2022-12-13 13:57:35,669 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/data/164fdf2be/9b04f3f2e0c943e59fc43168251bef38 [2022-12-13 13:57:35,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:57:35,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:57:35,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:57:35,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:57:35,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:57:35,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:35,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35283020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35, skipping insertion in model container [2022-12-13 13:57:35,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:35,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:57:35,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:57:35,903 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_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/sv-benchmarks/c/heap-data/calendar.i[23742,23755] [2022-12-13 13:57:35,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:57:35,914 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:57:35,939 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_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/sv-benchmarks/c/heap-data/calendar.i[23742,23755] [2022-12-13 13:57:35,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:57:35,955 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:57:35,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35 WrapperNode [2022-12-13 13:57:35,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:57:35,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:57:35,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:57:35,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:57:35,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:35,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:35,983 INFO L138 Inliner]: procedures = 121, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2022-12-13 13:57:35,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:57:35,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:57:35,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:57:35,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:57:35,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:35,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:35,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:35,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:35,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:35,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:36,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:36,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:36,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:57:36,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:57:36,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:57:36,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:57:36,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (1/1) ... [2022-12-13 13:57:36,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:57:36,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:36,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:57:36,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:57:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:57:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:57:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:57:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:57:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 13:57:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 13:57:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:57:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:57:36,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:57:36,145 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:57:36,146 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:57:36,278 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:57:36,283 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:57:36,283 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 13:57:36,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:57:36 BoogieIcfgContainer [2022-12-13 13:57:36,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:57:36,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:57:36,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:57:36,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:57:36,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:57:35" (1/3) ... [2022-12-13 13:57:36,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2086be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:57:36, skipping insertion in model container [2022-12-13 13:57:36,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:35" (2/3) ... [2022-12-13 13:57:36,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2086be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:57:36, skipping insertion in model container [2022-12-13 13:57:36,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:57:36" (3/3) ... [2022-12-13 13:57:36,291 INFO L112 eAbstractionObserver]: Analyzing ICFG calendar.i [2022-12-13 13:57:36,305 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:57:36,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:57:36,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:57:36,343 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;@14184fde, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:57:36,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 13:57:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 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 13:57:36,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 13:57:36,352 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:36,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:36,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash 399551724, now seen corresponding path program 1 times [2022-12-13 13:57:36,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:36,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516720172] [2022-12-13 13:57:36,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:36,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:36,484 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 13:57:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:36,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516720172] [2022-12-13 13:57:36,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516720172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:36,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:36,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:57:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995877375] [2022-12-13 13:57:36,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:36,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:57:36,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:36,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:57:36,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:57:36,522 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 13:57:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:36,536 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-12-13 13:57:36,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:57:36,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2022-12-13 13:57:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:36,543 INFO L225 Difference]: With dead ends: 35 [2022-12-13 13:57:36,543 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 13:57:36,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 13:57:36,547 INFO L413 NwaCegarLoop]: 27 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, 27 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 13:57:36,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 13:57:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-13 13:57:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 13:57:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-12-13 13:57:36,571 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2022-12-13 13:57:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:36,571 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-12-13 13:57:36,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 13:57:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-12-13 13:57:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 13:57:36,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:36,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:36,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:57:36,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:36,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1946762309, now seen corresponding path program 1 times [2022-12-13 13:57:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:36,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878281493] [2022-12-13 13:57:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:36,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:36,699 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 13:57:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:36,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878281493] [2022-12-13 13:57:36,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878281493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:36,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:36,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:57:36,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255097697] [2022-12-13 13:57:36,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:36,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:57:36,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:36,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:57:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:57:36,703 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13:57:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:36,751 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-12-13 13:57:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:57:36,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2022-12-13 13:57:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:36,752 INFO L225 Difference]: With dead ends: 35 [2022-12-13 13:57:36,752 INFO L226 Difference]: Without dead ends: 23 [2022-12-13 13:57:36,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:57:36,754 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:36,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-12-13 13:57:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-12-13 13:57:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 13:57:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-12-13 13:57:36,758 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2022-12-13 13:57:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:36,758 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-12-13 13:57:36,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13:57:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-12-13 13:57:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 13:57:36,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:36,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:36,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:57:36,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1070818203, now seen corresponding path program 1 times [2022-12-13 13:57:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:36,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113120285] [2022-12-13 13:57:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:36,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:37,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:37,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113120285] [2022-12-13 13:57:37,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113120285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:37,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:37,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:57:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454557228] [2022-12-13 13:57:37,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:37,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:57:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:37,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:57:37,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:37,147 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 13:57:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:37,503 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2022-12-13 13:57:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:57:37,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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) Word has length 17 [2022-12-13 13:57:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:37,504 INFO L225 Difference]: With dead ends: 78 [2022-12-13 13:57:37,505 INFO L226 Difference]: Without dead ends: 68 [2022-12-13 13:57:37,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-12-13 13:57:37,507 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 140 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:37,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 114 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:57:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-13 13:57:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 27. [2022-12-13 13:57:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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 13:57:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-12-13 13:57:37,515 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-12-13 13:57:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:37,515 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-12-13 13:57:37,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 13:57:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-12-13 13:57:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 13:57:37,516 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:37,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:37,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:57:37,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:37,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1737463723, now seen corresponding path program 1 times [2022-12-13 13:57:37,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:37,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156344755] [2022-12-13 13:57:37,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:37,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:57:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:37,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156344755] [2022-12-13 13:57:37,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156344755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:37,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:37,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:57:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081426960] [2022-12-13 13:57:37,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:37,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:57:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:57:37,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:57:37,599 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 13:57:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:37,649 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-12-13 13:57:37,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:57:37,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 19 [2022-12-13 13:57:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:37,650 INFO L225 Difference]: With dead ends: 50 [2022-12-13 13:57:37,650 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 13:57:37,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:57:37,651 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:37,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 13:57:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-12-13 13:57:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 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 13:57:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-12-13 13:57:37,658 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2022-12-13 13:57:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:37,659 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-12-13 13:57:37,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 13:57:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-12-13 13:57:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 13:57:37,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:37,660 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:37,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:57:37,660 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:37,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1737523305, now seen corresponding path program 1 times [2022-12-13 13:57:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:37,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427283619] [2022-12-13 13:57:37,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:37,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:57:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:37,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427283619] [2022-12-13 13:57:37,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427283619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:37,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:37,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:57:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200960494] [2022-12-13 13:57:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:37,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:57:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:37,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:57:37,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:57:37,706 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 13:57:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:37,721 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-12-13 13:57:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:57:37,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 19 [2022-12-13 13:57:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:37,722 INFO L225 Difference]: With dead ends: 34 [2022-12-13 13:57:37,722 INFO L226 Difference]: Without dead ends: 32 [2022-12-13 13:57:37,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:57:37,723 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:37,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:57:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-13 13:57:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-12-13 13:57:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 13:57:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-12-13 13:57:37,728 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 19 [2022-12-13 13:57:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:37,728 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-12-13 13:57:37,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 13:57:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-12-13 13:57:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 13:57:37,729 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:37,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:37,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:57:37,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:37,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash -782496211, now seen corresponding path program 1 times [2022-12-13 13:57:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:37,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053191841] [2022-12-13 13:57:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:37,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:37,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:37,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053191841] [2022-12-13 13:57:37,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053191841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:37,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:37,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:57:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14840558] [2022-12-13 13:57:37,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:37,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:57:37,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:37,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:57:37,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:37,909 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 13:57:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:38,169 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-12-13 13:57:38,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:57:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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) Word has length 19 [2022-12-13 13:57:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:38,171 INFO L225 Difference]: With dead ends: 76 [2022-12-13 13:57:38,171 INFO L226 Difference]: Without dead ends: 74 [2022-12-13 13:57:38,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-12-13 13:57:38,172 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 109 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:38,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 108 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:57:38,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-13 13:57:38,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 35. [2022-12-13 13:57:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 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 13:57:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-12-13 13:57:38,180 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 19 [2022-12-13 13:57:38,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:38,181 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-12-13 13:57:38,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 13:57:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-12-13 13:57:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 13:57:38,182 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:38,182 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:38,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:57:38,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash 830966801, now seen corresponding path program 1 times [2022-12-13 13:57:38,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:38,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919139141] [2022-12-13 13:57:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:38,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:38,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919139141] [2022-12-13 13:57:38,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919139141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:38,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748737945] [2022-12-13 13:57:38,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:38,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:38,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:38,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:38,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:57:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:38,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 13:57:38,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:38,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:38,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:38,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:57:38,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:57:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:38,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:57:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:38,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748737945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:57:38,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:57:38,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-12-13 13:57:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943538256] [2022-12-13 13:57:38,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:57:38,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:57:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:38,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:57:38,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:57:38,657 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 13:57:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:38,748 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-12-13 13:57:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:57:38,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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) Word has length 25 [2022-12-13 13:57:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:38,750 INFO L225 Difference]: With dead ends: 68 [2022-12-13 13:57:38,751 INFO L226 Difference]: Without dead ends: 40 [2022-12-13 13:57:38,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:57:38,752 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:38,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 125 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:57:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-13 13:57:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-12-13 13:57:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 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 13:57:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-12-13 13:57:38,759 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 25 [2022-12-13 13:57:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:38,760 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-12-13 13:57:38,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 13:57:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-12-13 13:57:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 13:57:38,760 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:38,761 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:38,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:57:38,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 13:57:38,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:38,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1524144039, now seen corresponding path program 2 times [2022-12-13 13:57:38,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:38,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434390197] [2022-12-13 13:57:38,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:39,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:39,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434390197] [2022-12-13 13:57:39,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434390197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:39,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696668780] [2022-12-13 13:57:39,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:57:39,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:39,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:39,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:39,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:57:39,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:57:39,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:57:39,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 13:57:39,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:39,633 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 13:57:39,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:39,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:39,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 13:57:39,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:39,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:39,731 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 13:57:39,732 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 15 treesize of output 15 [2022-12-13 13:57:39,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-12-13 13:57:39,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:57:39,926 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 41 treesize of output 25 [2022-12-13 13:57:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:40,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:57:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:40,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696668780] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:57:40,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:57:40,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 23 [2022-12-13 13:57:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228405382] [2022-12-13 13:57:40,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:57:40,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 13:57:40,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:40,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 13:57:40,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-12-13 13:57:40,294 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 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 13:57:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:42,660 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2022-12-13 13:57:42,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 13:57:42,661 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 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) Word has length 30 [2022-12-13 13:57:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:42,661 INFO L225 Difference]: With dead ends: 136 [2022-12-13 13:57:42,661 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 13:57:42,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=883, Invalid=2309, Unknown=0, NotChecked=0, Total=3192 [2022-12-13 13:57:42,668 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 606 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:42,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 297 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:57:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 13:57:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 48. [2022-12-13 13:57:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 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 13:57:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2022-12-13 13:57:42,675 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 30 [2022-12-13 13:57:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:42,675 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2022-12-13 13:57:42,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 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 13:57:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-12-13 13:57:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 13:57:42,676 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:42,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:42,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:57:42,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 13:57:42,877 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1895186671, now seen corresponding path program 1 times [2022-12-13 13:57:42,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:42,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531102974] [2022-12-13 13:57:42,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:42,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:43,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531102974] [2022-12-13 13:57:43,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531102974] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:43,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639914700] [2022-12-13 13:57:43,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:43,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:43,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:43,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:57:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:43,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 13:57:43,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:43,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:43,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:43,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 13:57:43,404 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 13:57:43,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:43,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:43,474 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 13:57:43,474 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 15 treesize of output 15 [2022-12-13 13:57:43,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-12-13 13:57:43,641 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 41 treesize of output 25 [2022-12-13 13:57:43,645 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 15 treesize of output 7 [2022-12-13 13:57:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:43,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:57:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:43,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639914700] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:57:43,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:57:43,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 18 [2022-12-13 13:57:43,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361022540] [2022-12-13 13:57:43,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:57:43,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:57:43,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:43,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:57:43,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=255, Unknown=1, NotChecked=0, Total=306 [2022-12-13 13:57:43,861 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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 13:57:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:44,570 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-12-13 13:57:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 13:57:44,571 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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) Word has length 32 [2022-12-13 13:57:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:44,571 INFO L225 Difference]: With dead ends: 67 [2022-12-13 13:57:44,571 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 13:57:44,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=363, Invalid=896, Unknown=1, NotChecked=0, Total=1260 [2022-12-13 13:57:44,572 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 221 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:44,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 221 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:57:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 13:57:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2022-12-13 13:57:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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 13:57:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-12-13 13:57:44,577 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 32 [2022-12-13 13:57:44,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:44,577 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2022-12-13 13:57:44,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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 13:57:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-12-13 13:57:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 13:57:44,577 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:44,578 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:44,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:57:44,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:44,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:44,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1135420755, now seen corresponding path program 3 times [2022-12-13 13:57:44,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:44,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488149337] [2022-12-13 13:57:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:45,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:45,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488149337] [2022-12-13 13:57:45,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488149337] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:45,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090332914] [2022-12-13 13:57:45,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:57:45,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:45,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:45,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:45,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:57:45,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 13:57:45,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:57:45,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 13:57:45,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:45,342 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 13:57:45,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:45,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:45,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:57:45,409 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:57:45,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:45,414 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 13:57:45,422 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 13:57:45,423 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 15 treesize of output 15 [2022-12-13 13:57:45,428 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 18 treesize of output 20 [2022-12-13 13:57:45,662 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-12-13 13:57:45,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-12-13 13:57:45,670 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 13:57:45,670 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-12-13 13:57:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:45,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:57:45,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:45,745 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2022-12-13 13:57:45,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:45,750 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-12-13 13:57:45,760 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 6 treesize of output 4 [2022-12-13 13:57:45,769 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 6 treesize of output 4 [2022-12-13 13:57:45,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:45,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-12-13 13:57:45,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:57:45,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-13 13:57:45,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:45,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-12-13 13:57:45,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:57:45,914 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 20 treesize of output 8 [2022-12-13 13:57:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:45,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090332914] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:57:45,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:57:45,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 16 [2022-12-13 13:57:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921182999] [2022-12-13 13:57:45,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:57:45,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 13:57:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 13:57:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:57:45,925 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 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 13:57:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:46,203 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-12-13 13:57:46,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:57:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 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) Word has length 38 [2022-12-13 13:57:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:46,204 INFO L225 Difference]: With dead ends: 102 [2022-12-13 13:57:46,204 INFO L226 Difference]: Without dead ends: 61 [2022-12-13 13:57:46,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:57:46,205 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:46,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 321 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:57:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-13 13:57:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-12-13 13:57:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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 13:57:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-12-13 13:57:46,212 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 38 [2022-12-13 13:57:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:46,213 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-12-13 13:57:46,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 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 13:57:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-12-13 13:57:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 13:57:46,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:46,213 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:46,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 13:57:46,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:46,415 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1704598909, now seen corresponding path program 4 times [2022-12-13 13:57:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:46,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075464221] [2022-12-13 13:57:46,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:46,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:47,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:47,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075464221] [2022-12-13 13:57:47,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075464221] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:47,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686709175] [2022-12-13 13:57:47,173 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:57:47,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:47,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:47,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:47,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:57:47,253 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:57:47,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:57:47,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 80 conjunts are in the unsatisfiable core [2022-12-13 13:57:47,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:47,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:47,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:47,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 13:57:47,273 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 13:57:47,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:47,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:47,352 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 13:57:47,352 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 32 treesize of output 36 [2022-12-13 13:57:47,372 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 13:57:47,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 13:57:47,467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:57:47,473 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:57:47,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:47,480 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 13:57:47,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:47,488 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 59 treesize of output 49 [2022-12-13 13:57:47,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:47,499 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-12-13 13:57:47,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2022-12-13 13:57:47,505 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 40 treesize of output 32 [2022-12-13 13:57:48,107 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-12-13 13:57:48,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 149 [2022-12-13 13:57:48,164 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-12-13 13:57:48,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 119 [2022-12-13 13:57:49,045 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-12-13 13:57:49,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 13:57:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:49,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:57:49,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:49,291 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2022-12-13 13:57:49,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:49,296 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2022-12-13 13:57:49,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:49,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 107 [2022-12-13 13:57:49,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:57:49,438 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 101 treesize of output 83 [2022-12-13 13:57:49,440 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 98 treesize of output 78 [2022-12-13 13:57:49,446 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:49,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2022-12-13 13:57:49,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:57:49,451 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 49 treesize of output 37 [2022-12-13 13:57:49,575 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 13:57:49,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2022-12-13 13:57:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:49,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686709175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:57:49,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:57:49,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 29 [2022-12-13 13:57:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608794109] [2022-12-13 13:57:49,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:57:49,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 13:57:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 13:57:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-12-13 13:57:49,577 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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 13:57:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:57:56,294 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2022-12-13 13:57:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 13:57:56,295 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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) Word has length 43 [2022-12-13 13:57:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:57:56,296 INFO L225 Difference]: With dead ends: 169 [2022-12-13 13:57:56,296 INFO L226 Difference]: Without dead ends: 154 [2022-12-13 13:57:56,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1518, Invalid=4334, Unknown=0, NotChecked=0, Total=5852 [2022-12-13 13:57:56,299 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 913 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:57:56,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 517 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:57:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-12-13 13:57:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 64. [2022-12-13 13:57:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 states have internal predecessors, (81), 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 13:57:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-12-13 13:57:56,313 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 43 [2022-12-13 13:57:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:57:56,313 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-12-13 13:57:56,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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 13:57:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-12-13 13:57:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 13:57:56,313 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:57:56,313 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:56,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 13:57:56,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 13:57:56,515 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:57:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash -781342395, now seen corresponding path program 2 times [2022-12-13 13:57:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:56,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867268274] [2022-12-13 13:57:56,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:56,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:57,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867268274] [2022-12-13 13:57:57,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867268274] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:57:57,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989031401] [2022-12-13 13:57:57,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:57:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:57:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:57:57,396 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:57:57,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:57:57,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:57:57,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:57:57,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-13 13:57:57,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:57:57,494 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 13:57:57,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:57,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:57,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 13:57:57,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:57,553 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 13:57:57,554 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 32 treesize of output 36 [2022-12-13 13:57:57,574 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 13:57:57,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 13:57:57,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:57:57,690 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:57:57,695 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:57:57,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:57,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2022-12-13 13:57:57,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:57,706 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 59 treesize of output 49 [2022-12-13 13:57:57,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:57,715 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-12-13 13:57:57,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2022-12-13 13:57:57,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:57:57,721 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 18 treesize of output 20 [2022-12-13 13:57:58,363 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-12-13 13:57:58,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 149 [2022-12-13 13:57:58,426 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2022-12-13 13:57:58,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 119 [2022-12-13 13:57:59,229 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-12-13 13:57:59,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 13:57:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:59,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:57:59,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:59,340 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2022-12-13 13:57:59,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:59,345 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2022-12-13 13:57:59,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:59,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 121 [2022-12-13 13:57:59,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:57:59,484 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 115 treesize of output 91 [2022-12-13 13:57:59,488 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 106 treesize of output 86 [2022-12-13 13:57:59,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:57:59,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 61 [2022-12-13 13:57:59,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:57:59,497 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 55 treesize of output 37 [2022-12-13 13:57:59,591 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 13:57:59,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2022-12-13 13:57:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:59,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989031401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:57:59,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:57:59,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 25 [2022-12-13 13:57:59,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176548223] [2022-12-13 13:57:59,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:57:59,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 13:57:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:59,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 13:57:59,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=524, Unknown=5, NotChecked=0, Total=600 [2022-12-13 13:57:59,594 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 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 13:58:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:05,777 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2022-12-13 13:58:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-13 13:58:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 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) Word has length 45 [2022-12-13 13:58:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:05,778 INFO L225 Difference]: With dead ends: 160 [2022-12-13 13:58:05,778 INFO L226 Difference]: Without dead ends: 158 [2022-12-13 13:58:05,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1772 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1573, Invalid=4742, Unknown=5, NotChecked=0, Total=6320 [2022-12-13 13:58:05,780 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 725 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:05,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 462 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 13:58:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-13 13:58:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 67. [2022-12-13 13:58:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 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 13:58:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-12-13 13:58:05,790 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 45 [2022-12-13 13:58:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:05,790 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-12-13 13:58:05,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 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 13:58:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-12-13 13:58:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 13:58:05,791 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:05,791 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:05,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 13:58:05,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 13:58:05,992 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:05,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2085516585, now seen corresponding path program 5 times [2022-12-13 13:58:05,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:05,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130642295] [2022-12-13 13:58:05,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:05,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:58:06,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:06,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130642295] [2022-12-13 13:58:06,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130642295] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:06,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335488537] [2022-12-13 13:58:06,656 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 13:58:06,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:06,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:06,657 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:06,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:58:07,042 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 13:58:07,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:58:07,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-13 13:58:07,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:07,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:58:07,067 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 13:58:07,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:58:07,112 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:58:07,116 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:58:07,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:07,120 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 13:58:07,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:07,124 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 13:58:07,137 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 13:58:07,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 13:58:07,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:07,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:07,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 13:58:07,218 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:58:07,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:58:07,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:07,231 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 13:58:07,231 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 56 treesize of output 52 [2022-12-13 13:58:07,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:07,243 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-13 13:58:07,243 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 33 treesize of output 50 [2022-12-13 13:58:07,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:07,259 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-12-13 13:58:07,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2022-12-13 13:58:07,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:58:07,832 INFO L321 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2022-12-13 13:58:07,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 150 treesize of output 88 [2022-12-13 13:58:07,843 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-12-13 13:58:07,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 35 [2022-12-13 13:58:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:58:07,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:08,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:08,278 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 129 [2022-12-13 13:58:08,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:08,283 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 111 [2022-12-13 13:58:08,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:08,702 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 387 treesize of output 367 [2022-12-13 13:58:08,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:08,710 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 340 [2022-12-13 13:58:08,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:08,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 333 treesize of output 302 [2022-12-13 13:58:08,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:08,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 509 treesize of output 643 [2022-12-13 13:58:08,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:08,774 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 369 treesize of output 372 [2022-12-13 13:58:08,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:08,793 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 333 treesize of output 336 [2022-12-13 13:58:13,727 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_25 0))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse4 v_arrayElimArr_27)) (.cse11 (store |c_#memory_$Pointer$.offset| .cse4 v_arrayElimArr_28))) (let ((.cse9 (store .cse11 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse6 (store .cse10 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse7 (select (select .cse6 .cse4) 0)) (.cse8 (select (select .cse9 .cse4) 0)) (.cse1 (store .cse11 v_prenex_9 v_prenex_7)) (.cse5 (store .cse10 v_prenex_9 v_prenex_8))) (let ((.cse2 (select (select .cse5 .cse4) 0)) (.cse3 (select (select .cse1 .cse4) 0)) (.cse0 (select (select .cse9 .cse7) .cse8))) (or (= .cse0 (select (select .cse1 .cse2) .cse3)) (= .cse4 (select (select .cse5 .cse2) .cse3)) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse4 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse0 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse4) 0)) (= (select (select .cse6 .cse7) .cse8) .cse4) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse14 (select v_prenex_8 0))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse14 v_arrayElimArr_27)) (.cse15 (store |c_#memory_$Pointer$.offset| .cse14 v_arrayElimArr_28))) (let ((.cse16 (store .cse15 v_prenex_9 v_prenex_7)) (.cse19 (store .cse13 v_prenex_9 v_prenex_8))) (let ((.cse17 (select (select .cse19 .cse14) 0)) (.cse18 (select (select .cse16 .cse14) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (let ((.cse12 (store .cse15 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse12 (select (select (store .cse13 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse14) 0)) (select (select .cse12 .cse14) 0))) 0) (not (= (select |c_#valid| .cse14) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse16 .cse17) .cse18) 0) (= (select (select .cse19 .cse17) .cse18) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse14 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_25 0))) (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse20 v_arrayElimArr_27)) (.cse23 (store |c_#memory_$Pointer$.offset| .cse20 v_arrayElimArr_28))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse20 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (let ((.cse21 (store .cse23 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse21 (select (select (store .cse22 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse20) 0)) (select (select .cse21 .cse20) 0))) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse20) 0)) (= (let ((.cse24 (store .cse23 v_prenex_9 v_prenex_7))) (select (select .cse24 (select (select (store .cse22 v_prenex_9 v_prenex_8) .cse20) 0)) (select (select .cse24 .cse20) 0))) 0) (not (= (select v_arrayElimArr_26 0) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_25 0))) (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse25 v_arrayElimArr_27)) (.cse28 (store |c_#memory_$Pointer$.offset| .cse25 v_arrayElimArr_28))) (or (= .cse25 (select (let ((.cse26 (store .cse27 v_prenex_9 v_prenex_8))) (select .cse26 (select (select .cse26 .cse25) 0))) (select (select (store .cse28 v_prenex_9 v_prenex_7) .cse25) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse25 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (let ((.cse29 (store .cse28 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse29 (select (select (store .cse27 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse25) 0)) (select (select .cse29 .cse25) 0))) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse25) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse32 (select v_arrayElimArr_25 0))) (let ((.cse38 (store |c_#memory_$Pointer$.base| .cse32 v_arrayElimArr_27)) (.cse39 (store |c_#memory_$Pointer$.offset| .cse32 v_arrayElimArr_28))) (let ((.cse33 (store .cse39 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse36 (store .cse38 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse34 (select (select .cse36 .cse32) 0)) (.cse35 (select (select .cse33 .cse32) 0))) (let ((.cse31 (select (let ((.cse37 (store .cse38 v_prenex_9 v_prenex_8))) (select .cse37 (select (select .cse37 .cse32) 0))) (select (select (store .cse39 v_prenex_9 v_prenex_7) .cse32) 0))) (.cse30 (select (select .cse36 .cse34) .cse35))) (or (= .cse30 .cse31) (= .cse32 .cse31) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse32 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse33 .cse34) .cse35) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse32) 0)) (= .cse30 .cse32) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse40 (select v_prenex_8 0))) (let ((.cse43 (store |c_#memory_$Pointer$.base| .cse40 v_arrayElimArr_27)) (.cse44 (store |c_#memory_$Pointer$.offset| .cse40 v_arrayElimArr_28))) (let ((.cse41 (select (let ((.cse45 (store .cse43 v_prenex_9 v_prenex_8))) (select .cse45 (select (select .cse45 .cse40) 0))) (select (select (store .cse44 v_prenex_9 v_prenex_7) .cse40) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse40 .cse41) (not (= (select |c_#valid| .cse40) 0)) (= (select (let ((.cse42 (store .cse43 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse42 (select (select .cse42 .cse40) 0))) (select (select (store .cse44 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse40) 0)) .cse41) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse41 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse40 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse47 (select v_prenex_8 0))) (let ((.cse46 (select (let ((.cse48 (store (store |c_#memory_$Pointer$.base| .cse47 v_arrayElimArr_27) v_prenex_9 v_prenex_8))) (select .cse48 (select (select .cse48 .cse47) 0))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse47 v_arrayElimArr_28) v_prenex_9 v_prenex_7) .cse47) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_prenex_9 .cse46)) (not (= (select |c_#valid| .cse47) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse46 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse47 1) v_prenex_9) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse52 (select v_prenex_8 0))) (let ((.cse56 (store |c_#memory_$Pointer$.base| .cse52 v_arrayElimArr_27)) (.cse57 (store |c_#memory_$Pointer$.offset| .cse52 v_arrayElimArr_28))) (let ((.cse49 (store .cse57 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse54 (store .cse56 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse50 (select (select .cse54 .cse52) 0)) (.cse51 (select (select .cse49 .cse52) 0)) (.cse53 (select (let ((.cse55 (store .cse56 v_prenex_9 v_prenex_8))) (select .cse55 (select (select .cse55 .cse52) 0))) (select (select (store .cse57 v_prenex_9 v_prenex_7) .cse52) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select .cse49 .cse50) .cse51) 0) (= .cse52 .cse53) (not (= (select |c_#valid| .cse52) 0)) (= (select (select .cse54 .cse50) .cse51) .cse53) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse53 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse52 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse58 (select v_prenex_8 0))) (let ((.cse63 (store |c_#memory_$Pointer$.base| .cse58 v_arrayElimArr_27)) (.cse64 (store |c_#memory_$Pointer$.offset| .cse58 v_arrayElimArr_28))) (let ((.cse59 (store .cse64 v_prenex_9 v_prenex_7)) (.cse65 (store .cse63 v_prenex_9 v_prenex_8))) (let ((.cse60 (select (select .cse65 .cse58) 0)) (.cse61 (select (select .cse59 .cse58) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse58) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse59 .cse60) .cse61) 0) (= (select (let ((.cse62 (store .cse63 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse62 (select (select .cse62 .cse58) 0))) (select (select (store .cse64 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse58) 0)) .cse58) (= (select (select .cse65 .cse60) .cse61) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse58 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse69 (select v_arrayElimArr_25 0))) (let ((.cse68 (store |c_#memory_$Pointer$.base| .cse69 v_arrayElimArr_27)) (.cse70 (store |c_#memory_$Pointer$.offset| .cse69 v_arrayElimArr_28))) (let ((.cse74 (store .cse70 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse71 (store .cse68 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse72 (select (select .cse71 .cse69) 0)) (.cse73 (select (select .cse74 .cse69) 0))) (let ((.cse66 (select (select .cse74 .cse72) .cse73))) (or (= .cse66 (let ((.cse67 (store .cse70 v_prenex_9 v_prenex_7))) (select (select .cse67 (select (select (store .cse68 v_prenex_9 v_prenex_8) .cse69) 0)) (select (select .cse67 .cse69) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse69 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse66 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse69) 0)) (not (= (select (select .cse71 .cse72) .cse73) |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse79 (select v_arrayElimArr_25 0))) (let ((.cse80 (store |c_#memory_$Pointer$.base| .cse79 v_arrayElimArr_27)) (.cse81 (store |c_#memory_$Pointer$.offset| .cse79 v_arrayElimArr_28))) (let ((.cse82 (store .cse81 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse75 (store .cse80 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse76 (select (select .cse75 .cse79) 0)) (.cse77 (select (select .cse82 .cse79) 0))) (or (= (select (select .cse75 .cse76) .cse77) (select (let ((.cse78 (store .cse80 v_prenex_9 v_prenex_8))) (select .cse78 (select (select .cse78 .cse79) 0))) (select (select (store .cse81 v_prenex_9 v_prenex_7) .cse79) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse79 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse82 .cse76) .cse77) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse79) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse83 (select v_arrayElimArr_25 0))) (let ((.cse85 (store |c_#memory_$Pointer$.base| .cse83 v_arrayElimArr_27)) (.cse86 (store |c_#memory_$Pointer$.offset| .cse83 v_arrayElimArr_28))) (let ((.cse87 (store .cse86 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse90 (store .cse85 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse88 (select (select .cse90 .cse83) 0)) (.cse89 (select (select .cse87 .cse83) 0))) (or (= .cse83 (select (let ((.cse84 (store .cse85 v_prenex_9 v_prenex_8))) (select .cse84 (select (select .cse84 .cse83) 0))) (select (select (store .cse86 v_prenex_9 v_prenex_7) .cse83) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse83 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse87 .cse88) .cse89) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse83) 0)) (= (select (select .cse90 .cse88) .cse89) .cse83) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse91 (select v_prenex_8 0))) (let ((.cse97 (store |c_#memory_$Pointer$.base| .cse91 v_arrayElimArr_27)) (.cse98 (store |c_#memory_$Pointer$.offset| .cse91 v_arrayElimArr_28))) (let ((.cse93 (store .cse98 v_prenex_9 v_prenex_7)) (.cse99 (store .cse97 v_prenex_9 v_prenex_8))) (let ((.cse94 (select (select .cse99 .cse91) 0)) (.cse95 (select (select .cse93 .cse91) 0))) (let ((.cse92 (select (select .cse99 .cse94) .cse95))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse91 .cse92) (not (= (select |c_#valid| .cse91) 0)) (= (select (select .cse93 .cse94) .cse95) (let ((.cse96 (store .cse98 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse96 (select (select (store .cse97 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse91) 0)) (select (select .cse96 .cse91) 0)))) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse92 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse91 1) v_prenex_9) 0))))))))) (forall ((v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int)) (let ((.cse100 (select v_arrayElimArr_25 0))) (let ((.cse101 (store (store |c_#memory_$Pointer$.offset| .cse100 v_arrayElimArr_28) |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse104 (store (store |c_#memory_$Pointer$.base| .cse100 v_arrayElimArr_27) |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse102 (select (select .cse104 .cse100) 0)) (.cse103 (select (select .cse101 .cse100) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse100 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse101 .cse102) .cse103) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse100) 0)) (not (= (select (select .cse104 .cse102) .cse103) |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse108 (select v_prenex_8 0))) (let ((.cse115 (store |c_#memory_$Pointer$.base| .cse108 v_arrayElimArr_27)) (.cse116 (store |c_#memory_$Pointer$.offset| .cse108 v_arrayElimArr_28))) (let ((.cse111 (store .cse116 v_prenex_9 v_prenex_7)) (.cse114 (store .cse115 v_prenex_9 v_prenex_8))) (let ((.cse112 (select (select .cse114 .cse108) 0)) (.cse113 (select (select .cse111 .cse108) 0)) (.cse105 (store .cse116 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse109 (store .cse115 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse106 (select (select .cse109 .cse108) 0)) (.cse107 (select (select .cse105 .cse108) 0)) (.cse110 (select (select .cse114 .cse112) .cse113))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select .cse105 .cse106) .cse107) 0) (not (= (select |c_#valid| .cse108) 0)) (= (select (select .cse109 .cse106) .cse107) .cse110) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse111 .cse112) .cse113) 0) (= .cse110 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse108 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse121 (select v_arrayElimArr_25 0))) (let ((.cse127 (store |c_#memory_$Pointer$.base| .cse121 v_arrayElimArr_27)) (.cse128 (store |c_#memory_$Pointer$.offset| .cse121 v_arrayElimArr_28))) (let ((.cse126 (store .cse128 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse123 (store .cse127 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse124 (select (select .cse123 .cse121) 0)) (.cse125 (select (select .cse126 .cse121) 0)) (.cse118 (store .cse128 v_prenex_9 v_prenex_7)) (.cse122 (store .cse127 v_prenex_9 v_prenex_8))) (let ((.cse119 (select (select .cse122 .cse121) 0)) (.cse120 (select (select .cse118 .cse121) 0)) (.cse117 (select (select .cse126 .cse124) .cse125))) (or (= .cse117 (select (select .cse118 .cse119) .cse120)) (= .cse121 (select (select .cse122 .cse119) .cse120)) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse121 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse117 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse121) 0)) (not (= (select (select .cse123 .cse124) .cse125) |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse131 (select v_arrayElimArr_25 0))) (let ((.cse137 (store |c_#memory_$Pointer$.base| .cse131 v_arrayElimArr_27)) (.cse138 (store |c_#memory_$Pointer$.offset| .cse131 v_arrayElimArr_28))) (let ((.cse132 (store .cse138 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse135 (store .cse137 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse133 (select (select .cse135 .cse131) 0)) (.cse134 (select (select .cse132 .cse131) 0))) (let ((.cse130 (select (let ((.cse136 (store .cse137 v_prenex_9 v_prenex_8))) (select .cse136 (select (select .cse136 .cse131) 0))) (select (select (store .cse138 v_prenex_9 v_prenex_7) .cse131) 0))) (.cse129 (select (select .cse135 .cse133) .cse134))) (or (= .cse129 .cse130) (= .cse131 .cse130) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse131 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse132 .cse133) .cse134) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse131) 0)) (not (= .cse129 |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse140 (select v_prenex_8 0))) (let ((.cse141 (store (store |c_#memory_$Pointer$.offset| .cse140 v_arrayElimArr_28) v_prenex_9 v_prenex_7)) (.cse144 (store (store |c_#memory_$Pointer$.base| .cse140 v_arrayElimArr_27) v_prenex_9 v_prenex_8))) (let ((.cse142 (select (select .cse144 .cse140) 0)) (.cse143 (select (select .cse141 .cse140) 0))) (let ((.cse139 (select (select .cse144 .cse142) .cse143))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_prenex_9 .cse139)) (not (= (select |c_#valid| .cse140) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse141 .cse142) .cse143) 0) (= .cse139 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse140 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse145 (select v_prenex_8 0))) (let ((.cse155 (store |c_#memory_$Pointer$.base| .cse145 v_arrayElimArr_27)) (.cse156 (store |c_#memory_$Pointer$.offset| .cse145 v_arrayElimArr_28))) (let ((.cse147 (store .cse156 v_prenex_9 v_prenex_7)) (.cse154 (store .cse155 v_prenex_9 v_prenex_8))) (let ((.cse148 (select (select .cse154 .cse145) 0)) (.cse149 (select (select .cse147 .cse145) 0)) (.cse150 (store .cse156 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse153 (store .cse155 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse151 (select (select .cse153 .cse145) 0)) (.cse152 (select (select .cse150 .cse145) 0)) (.cse146 (select (select .cse154 .cse148) .cse149))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse145 .cse146) (not (= (select |c_#valid| .cse145) 0)) (= (select (select .cse147 .cse148) .cse149) (select (select .cse150 .cse151) .cse152)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse153 .cse151) .cse152) .cse145) (= .cse146 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse145 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse160 (select v_arrayElimArr_25 0))) (let ((.cse159 (store |c_#memory_$Pointer$.base| .cse160 v_arrayElimArr_27)) (.cse161 (store |c_#memory_$Pointer$.offset| .cse160 v_arrayElimArr_28))) (let ((.cse157 (let ((.cse162 (store .cse161 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse162 (select (select (store .cse159 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse160) 0)) (select (select .cse162 .cse160) 0))))) (or (= .cse157 (let ((.cse158 (store .cse161 v_prenex_9 v_prenex_7))) (select (select .cse158 (select (select (store .cse159 v_prenex_9 v_prenex_8) .cse160) 0)) (select (select .cse158 .cse160) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse160 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse157 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse160) 0)) (not (= (select v_arrayElimArr_26 0) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse167 (select v_arrayElimArr_25 0))) (let ((.cse170 (store |c_#memory_$Pointer$.base| .cse167 v_arrayElimArr_27)) (.cse171 (store |c_#memory_$Pointer$.offset| .cse167 v_arrayElimArr_28))) (let ((.cse164 (store .cse171 v_prenex_9 v_prenex_7)) (.cse168 (store .cse170 v_prenex_9 v_prenex_8))) (let ((.cse165 (select (select .cse168 .cse167) 0)) (.cse166 (select (select .cse164 .cse167) 0)) (.cse163 (let ((.cse169 (store .cse171 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse169 (select (select (store .cse170 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse167) 0)) (select (select .cse169 .cse167) 0))))) (or (= .cse163 (select (select .cse164 .cse165) .cse166)) (= .cse167 (select (select .cse168 .cse165) .cse166)) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse167 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse163 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse167) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse176 (select v_arrayElimArr_25 0))) (let ((.cse179 (store |c_#memory_$Pointer$.base| .cse176 v_arrayElimArr_27)) (.cse180 (store |c_#memory_$Pointer$.offset| .cse176 v_arrayElimArr_28))) (let ((.cse177 (store .cse180 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse172 (store .cse179 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse175 (select (let ((.cse178 (store .cse179 v_prenex_9 v_prenex_8))) (select .cse178 (select (select .cse178 .cse176) 0))) (select (select (store .cse180 v_prenex_9 v_prenex_7) .cse176) 0))) (.cse173 (select (select .cse172 .cse176) 0)) (.cse174 (select (select .cse177 .cse176) 0))) (or (= (select (select .cse172 .cse173) .cse174) .cse175) (= .cse176 .cse175) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse176 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse177 .cse173) .cse174) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse176) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse181 (select v_prenex_8 0))) (let ((.cse183 (store |c_#memory_$Pointer$.base| .cse181 v_arrayElimArr_27)) (.cse184 (store |c_#memory_$Pointer$.offset| .cse181 v_arrayElimArr_28))) (let ((.cse186 (store .cse184 v_prenex_9 v_prenex_7)) (.cse189 (store .cse183 v_prenex_9 v_prenex_8))) (let ((.cse187 (select (select .cse189 .cse181) 0)) (.cse188 (select (select .cse186 .cse181) 0))) (let ((.cse185 (select (select .cse189 .cse187) .cse188))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse181) 0)) (= (select (let ((.cse182 (store .cse183 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse182 (select (select .cse182 .cse181) 0))) (select (select (store .cse184 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse181) 0)) .cse185) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse186 .cse187) .cse188) 0) (= .cse185 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse181 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse190 (select v_prenex_8 0))) (let ((.cse200 (store |c_#memory_$Pointer$.base| .cse190 v_arrayElimArr_27)) (.cse201 (store |c_#memory_$Pointer$.offset| .cse190 v_arrayElimArr_28))) (let ((.cse199 (store .cse201 v_prenex_9 v_prenex_7)) (.cse196 (store .cse200 v_prenex_9 v_prenex_8))) (let ((.cse192 (store .cse201 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse195 (store .cse200 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25)) (.cse197 (select (select .cse196 .cse190) 0)) (.cse198 (select (select .cse199 .cse190) 0))) (let ((.cse191 (select (select .cse199 .cse197) .cse198)) (.cse193 (select (select .cse195 .cse190) 0)) (.cse194 (select (select .cse192 .cse190) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse190) 0)) (= .cse191 (select (select .cse192 .cse193) .cse194)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse191 0) (= (select (select .cse195 .cse193) .cse194) .cse190) (= (select (select .cse196 .cse197) .cse198) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse190 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse202 (select v_prenex_8 0))) (let ((.cse205 (store |c_#memory_$Pointer$.base| .cse202 v_arrayElimArr_27)) (.cse206 (store |c_#memory_$Pointer$.offset| .cse202 v_arrayElimArr_28))) (let ((.cse203 (select (let ((.cse207 (store .cse205 v_prenex_9 v_prenex_8))) (select .cse207 (select (select .cse207 .cse202) 0))) (select (select (store .cse206 v_prenex_9 v_prenex_7) .cse202) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse202 .cse203) (not (= (select |c_#valid| .cse202) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (let ((.cse204 (store .cse205 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse204 (select (select .cse204 .cse202) 0))) (select (select (store .cse206 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse202) 0)) .cse202) (= .cse203 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse202 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse208 (select v_prenex_8 0))) (let ((.cse212 (store |c_#memory_$Pointer$.base| .cse208 v_arrayElimArr_27)) (.cse213 (store |c_#memory_$Pointer$.offset| .cse208 v_arrayElimArr_28))) (let ((.cse210 (select (let ((.cse214 (store .cse212 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse214 (select (select .cse214 .cse208) 0))) (select (select (store .cse213 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse208) 0))) (.cse209 (select (let ((.cse211 (store .cse212 v_prenex_9 v_prenex_8))) (select .cse211 (select (select .cse211 .cse208) 0))) (select (select (store .cse213 v_prenex_9 v_prenex_7) .cse208) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse208 .cse209) (not (= (select |c_#valid| .cse208) 0)) (= .cse210 .cse209) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse210 .cse208) (= .cse209 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse208 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse215 (select v_prenex_8 0))) (let ((.cse218 (store |c_#memory_$Pointer$.base| .cse215 v_arrayElimArr_27)) (.cse219 (store |c_#memory_$Pointer$.offset| .cse215 v_arrayElimArr_28))) (let ((.cse223 (store .cse219 v_prenex_9 v_prenex_7)) (.cse220 (store .cse218 v_prenex_9 v_prenex_8))) (let ((.cse221 (select (select .cse220 .cse215) 0)) (.cse222 (select (select .cse223 .cse215) 0))) (let ((.cse216 (select (select .cse223 .cse221) .cse222))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse215) 0)) (= .cse216 (let ((.cse217 (store .cse219 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse217 (select (select (store .cse218 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse215) 0)) (select (select .cse217 .cse215) 0)))) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse216 0) (= (select (select .cse220 .cse221) .cse222) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse215 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse224 (select v_arrayElimArr_25 0))) (let ((.cse230 (store |c_#memory_$Pointer$.base| .cse224 v_arrayElimArr_27)) (.cse231 (store |c_#memory_$Pointer$.offset| .cse224 v_arrayElimArr_28))) (let ((.cse225 (store .cse231 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse228 (store .cse230 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse226 (select (select .cse228 .cse224) 0)) (.cse227 (select (select .cse225 .cse224) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse224 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse225 .cse226) .cse227) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse224) 0)) (= (select (select .cse228 .cse226) .cse227) .cse224) (= (let ((.cse229 (store .cse231 v_prenex_9 v_prenex_7))) (select (select .cse229 (select (select (store .cse230 v_prenex_9 v_prenex_8) .cse224) 0)) (select (select .cse229 .cse224) 0))) 0) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse234 (select v_prenex_8 0))) (let ((.cse233 (store |c_#memory_$Pointer$.base| .cse234 v_arrayElimArr_27)) (.cse235 (store |c_#memory_$Pointer$.offset| .cse234 v_arrayElimArr_28))) (let ((.cse236 (select (let ((.cse237 (store .cse233 v_prenex_9 v_prenex_8))) (select .cse237 (select (select .cse237 .cse234) 0))) (select (select (store .cse235 v_prenex_9 v_prenex_7) .cse234) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (let ((.cse232 (store .cse235 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse232 (select (select (store .cse233 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse234) 0)) (select (select .cse232 .cse234) 0))) 0) (= .cse234 .cse236) (not (= (select |c_#valid| .cse234) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse236 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse234 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse241 (select v_arrayElimArr_25 0))) (let ((.cse240 (store |c_#memory_$Pointer$.base| .cse241 v_arrayElimArr_27)) (.cse242 (store |c_#memory_$Pointer$.offset| .cse241 v_arrayElimArr_28))) (let ((.cse246 (store .cse242 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse243 (store .cse240 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse244 (select (select .cse243 .cse241) 0)) (.cse245 (select (select .cse246 .cse241) 0))) (let ((.cse238 (select (select .cse246 .cse244) .cse245))) (or (= .cse238 (let ((.cse239 (store .cse242 v_prenex_9 v_prenex_7))) (select (select .cse239 (select (select (store .cse240 v_prenex_9 v_prenex_8) .cse241) 0)) (select (select .cse239 .cse241) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse241 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse238 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse241) 0)) (= (select (select .cse243 .cse244) .cse245) .cse241) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse249 (select v_arrayElimArr_25 0))) (let ((.cse250 (store |c_#memory_$Pointer$.base| .cse249 v_arrayElimArr_27)) (.cse251 (store |c_#memory_$Pointer$.offset| .cse249 v_arrayElimArr_28))) (let ((.cse252 (store .cse251 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse255 (store .cse250 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse253 (select (select .cse255 .cse249) 0)) (.cse254 (select (select .cse252 .cse249) 0))) (let ((.cse247 (select (select .cse255 .cse253) .cse254))) (or (= .cse247 (select (let ((.cse248 (store .cse250 v_prenex_9 v_prenex_8))) (select .cse248 (select (select .cse248 .cse249) 0))) (select (select (store .cse251 v_prenex_9 v_prenex_7) .cse249) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse249 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse252 .cse253) .cse254) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse249) 0)) (not (= .cse247 |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse258 (select v_arrayElimArr_25 0))) (let ((.cse259 (store |c_#memory_$Pointer$.base| .cse258 v_arrayElimArr_27)) (.cse260 (store |c_#memory_$Pointer$.offset| .cse258 v_arrayElimArr_28))) (let ((.cse261 (store .cse260 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse264 (store .cse259 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse262 (select (select .cse264 .cse258) 0)) (.cse263 (select (select .cse261 .cse258) 0))) (let ((.cse256 (select (select .cse264 .cse262) .cse263))) (or (= .cse256 (select (let ((.cse257 (store .cse259 v_prenex_9 v_prenex_8))) (select .cse257 (select (select .cse257 .cse258) 0))) (select (select (store .cse260 v_prenex_9 v_prenex_7) .cse258) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse258 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse261 .cse262) .cse263) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse258) 0)) (= .cse256 .cse258) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse265 (select v_prenex_8 0))) (let ((.cse273 (store |c_#memory_$Pointer$.base| .cse265 v_arrayElimArr_27)) (.cse274 (store |c_#memory_$Pointer$.offset| .cse265 v_arrayElimArr_28))) (let ((.cse268 (store .cse274 v_prenex_9 v_prenex_7)) (.cse271 (store .cse273 v_prenex_9 v_prenex_8))) (let ((.cse269 (select (select .cse271 .cse265) 0)) (.cse270 (select (select .cse268 .cse265) 0))) (let ((.cse266 (select (let ((.cse272 (store .cse273 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse272 (select (select .cse272 .cse265) 0))) (select (select (store .cse274 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse265) 0))) (.cse267 (select (select .cse271 .cse269) .cse270))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse265) 0)) (= .cse266 .cse267) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse268 .cse269) .cse270) 0) (= .cse266 .cse265) (= .cse267 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse265 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse276 (select v_prenex_8 0))) (let ((.cse283 (store |c_#memory_$Pointer$.base| .cse276 v_arrayElimArr_27)) (.cse284 (store |c_#memory_$Pointer$.offset| .cse276 v_arrayElimArr_28))) (let ((.cse281 (store .cse284 v_prenex_9 v_prenex_7)) (.cse278 (store .cse283 v_prenex_9 v_prenex_8))) (let ((.cse279 (select (select .cse278 .cse276) 0)) (.cse280 (select (select .cse281 .cse276) 0))) (let ((.cse275 (let ((.cse282 (store .cse284 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse282 (select (select (store .cse283 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse276) 0)) (select (select .cse282 .cse276) 0)))) (.cse277 (select (select .cse281 .cse279) .cse280))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse275 0) (not (= (select |c_#valid| .cse276) 0)) (= .cse277 .cse275) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse277 0) (= (select (select .cse278 .cse279) .cse280) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse276 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse286 (select v_prenex_8 0))) (let ((.cse293 (store |c_#memory_$Pointer$.base| .cse286 v_arrayElimArr_27)) (.cse294 (store |c_#memory_$Pointer$.offset| .cse286 v_arrayElimArr_28))) (let ((.cse288 (store .cse294 v_prenex_9 v_prenex_7)) (.cse291 (store .cse293 v_prenex_9 v_prenex_8))) (let ((.cse289 (select (select .cse291 .cse286) 0)) (.cse290 (select (select .cse288 .cse286) 0))) (let ((.cse285 (let ((.cse292 (store .cse294 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse292 (select (select (store .cse293 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse286) 0)) (select (select .cse292 .cse286) 0)))) (.cse287 (select (select .cse291 .cse289) .cse290))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse285 0) (= .cse286 .cse287) (not (= (select |c_#valid| .cse286) 0)) (= (select (select .cse288 .cse289) .cse290) .cse285) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse287 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse286 1) v_prenex_9) 0)))))))))) is different from false [2022-12-13 13:58:18,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:18,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 216 [2022-12-13 13:58:18,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:18,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 144 [2022-12-13 13:58:18,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:18,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:18,786 INFO L321 Elim1Store]: treesize reduction 43, result has 53.3 percent of original size [2022-12-13 13:58:18,786 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 863 treesize of output 785 [2022-12-13 13:58:18,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:18,804 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 657 treesize of output 651 [2022-12-13 13:58:18,822 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 670 treesize of output 491 [2022-12-13 13:58:18,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:18,840 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 365 treesize of output 315 [2022-12-13 13:58:18,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:18,860 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 210 treesize of output 192 [2022-12-13 13:58:18,880 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 48 treesize of output 40 [2022-12-13 13:58:18,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2022-12-13 13:58:18,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:18,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:18,907 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 13:58:18,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 13:58:19,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:19,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 197 [2022-12-13 13:58:19,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:19,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 137 [2022-12-13 13:58:19,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:19,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:19,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:19,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:19,091 INFO L321 Elim1Store]: treesize reduction 43, result has 53.3 percent of original size [2022-12-13 13:58:19,091 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 871 treesize of output 633 [2022-12-13 13:58:19,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:19,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:19,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:19,107 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 650 treesize of output 636 [2022-12-13 13:58:19,125 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 652 treesize of output 526 [2022-12-13 13:58:19,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:19,142 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 521 treesize of output 483 [2022-12-13 13:58:19,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:19,157 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 450 treesize of output 400 [2022-12-13 13:58:19,170 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 13:58:19,171 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 22 treesize of output 18 [2022-12-13 13:58:19,187 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 42 treesize of output 36 [2022-12-13 13:58:19,198 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 42 treesize of output 34 [2022-12-13 13:58:19,427 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 1 [2022-12-13 13:58:19,433 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 1 [2022-12-13 13:58:19,439 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2022-12-13 13:58:19,447 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2022-12-13 13:58:19,453 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2022-12-13 13:58:19,460 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 1 [2022-12-13 13:58:19,466 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2022-12-13 13:58:19,479 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 1 [2022-12-13 13:58:19,486 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 1 [2022-12-13 13:58:19,493 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2022-12-13 13:58:19,500 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-12-13 13:58:19,507 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 1 [2022-12-13 13:58:19,514 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 1 [2022-12-13 13:58:19,522 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2022-12-13 13:58:19,528 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2022-12-13 13:58:19,536 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-12-13 13:58:19,544 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-12-13 13:58:19,553 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,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 1 case distinctions, treesize of input 235 treesize of output 1 [2022-12-13 13:58:19,561 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 1 [2022-12-13 13:58:19,567 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 1 [2022-12-13 13:58:19,574 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-12-13 13:58:19,581 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 1 [2022-12-13 13:58:19,590 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 1 [2022-12-13 13:58:19,599 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2022-12-13 13:58:19,608 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 1 [2022-12-13 13:58:19,616 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 1 [2022-12-13 13:58:19,624 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-12-13 13:58:19,633 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 1 [2022-12-13 13:58:19,640 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2022-12-13 13:58:19,648 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2022-12-13 13:58:19,655 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2022-12-13 13:58:19,663 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2022-12-13 13:58:19,672 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:58:19,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 1 [2022-12-13 13:58:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-12-13 13:58:19,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335488537] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:19,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:19,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 36 [2022-12-13 13:58:19,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772631635] [2022-12-13 13:58:19,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:19,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 13:58:19,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:19,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 13:58:19,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1067, Unknown=1, NotChecked=66, Total=1260 [2022-12-13 13:58:19,691 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 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 13:58:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:23,462 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2022-12-13 13:58:23,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-13 13:58:23,463 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 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) Word has length 51 [2022-12-13 13:58:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:58:23,463 INFO L225 Difference]: With dead ends: 200 [2022-12-13 13:58:23,463 INFO L226 Difference]: Without dead ends: 129 [2022-12-13 13:58:23,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=523, Invalid=4172, Unknown=1, NotChecked=134, Total=4830 [2022-12-13 13:58:23,464 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 124 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:58:23,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1212 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 934 Invalid, 0 Unknown, 90 Unchecked, 1.1s Time] [2022-12-13 13:58:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-13 13:58:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2022-12-13 13:58:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 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 13:58:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2022-12-13 13:58:23,473 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 51 [2022-12-13 13:58:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:58:23,473 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2022-12-13 13:58:23,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 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 13:58:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-12-13 13:58:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 13:58:23,474 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:58:23,474 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:23,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 13:58:23,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 13:58:23,676 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:58:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:23,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1013477057, now seen corresponding path program 6 times [2022-12-13 13:58:23,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:23,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139022552] [2022-12-13 13:58:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:58:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:25,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139022552] [2022-12-13 13:58:25,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139022552] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:25,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977882213] [2022-12-13 13:58:25,794 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 13:58:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:25,795 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:25,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:58:26,216 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-13 13:58:26,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:58:26,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 106 conjunts are in the unsatisfiable core [2022-12-13 13:58:26,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:26,230 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 13:58:26,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 13:58:26,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:58:26,340 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 13:58:26,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 13:58:26,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-12-13 13:58:26,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:58:26,477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:58:26,483 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:58:26,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,489 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 59 treesize of output 49 [2022-12-13 13:58:26,503 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-13 13:58:26,503 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 40 treesize of output 44 [2022-12-13 13:58:26,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,527 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-12-13 13:58:26,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-12-13 13:58:26,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,540 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 18 treesize of output 20 [2022-12-13 13:58:26,701 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:58:26,707 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:58:26,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,722 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 13:58:26,723 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 119 treesize of output 83 [2022-12-13 13:58:26,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-12-13 13:58:26,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:26,748 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-12-13 13:58:26,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-12-13 13:58:26,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-12-13 13:58:28,352 INFO L321 Elim1Store]: treesize reduction 236, result has 45.0 percent of original size [2022-12-13 13:58:28,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 297 treesize of output 321 [2022-12-13 13:58:28,594 INFO L321 Elim1Store]: treesize reduction 224, result has 38.6 percent of original size [2022-12-13 13:58:28,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 193 treesize of output 275 [2022-12-13 13:58:33,938 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-12-13 13:58:33,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 13:58:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:58:33,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:34,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:34,378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 135 [2022-12-13 13:58:34,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:34,387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 117 [2022-12-13 13:58:34,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:34,590 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 251 [2022-12-13 13:58:34,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:34,598 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 221 [2022-12-13 13:58:34,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_40| Int) (v_ArrVal_921 (Array Int Int)) (v_ArrVal_914 (Array Int Int)) (v_arrayElimArr_71 (Array Int Int)) (v_arrayElimArr_73 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (v_arrayElimArr_74 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_71 0))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_74) |v_ULTIMATE.start_main_~l~0#1.base_40| v_arrayElimArr_72)) (.cse7 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_73) |v_ULTIMATE.start_main_~l~0#1.base_40| v_arrayElimArr_71)) (.cse1 (select v_arrayElimArr_72 0))) (let ((.cse5 (select (select .cse7 .cse0) .cse1)) (.cse6 (select (select .cse4 .cse0) .cse1))) (let ((.cse2 (select (store (store |c_#memory_int| .cse0 v_ArrVal_914) |v_ULTIMATE.start_main_~l~0#1.base_40| v_ArrVal_921) (select (select .cse7 .cse5) .cse6))) (.cse3 (select (select .cse4 .cse5) .cse6))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_74 .cse1))) (not (= (select v_arrayElimArr_73 .cse1) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= .cse1 0)) (not (= (select .cse2 (+ .cse3 8)) 3)) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_40|) 0)) (not (= (select .cse2 (+ .cse3 4)) 1)))))))) is different from false [2022-12-13 13:58:34,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:34,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 467 treesize of output 363 [2022-12-13 13:58:34,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:58:34,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 347 treesize of output 243 [2022-12-13 13:58:34,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:34,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:34,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:34,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:34,773 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 119 [2022-12-13 13:58:34,777 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 174 treesize of output 142 [2022-12-13 13:58:34,781 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 124 treesize of output 104 [2022-12-13 13:58:34,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:34,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:34,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:58:34,787 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 67 treesize of output 43 [2022-12-13 13:58:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-12-13 13:58:34,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977882213] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:34,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:34,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 39 [2022-12-13 13:58:34,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864679151] [2022-12-13 13:58:34,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:34,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 13:58:34,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:34,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 13:58:34,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1302, Unknown=3, NotChecked=72, Total=1482 [2022-12-13 13:58:34,975 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 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 13:59:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:59:01,402 INFO L93 Difference]: Finished difference Result 351 states and 426 transitions. [2022-12-13 13:59:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-12-13 13:59:01,402 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 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) Word has length 56 [2022-12-13 13:59:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:59:01,402 INFO L225 Difference]: With dead ends: 351 [2022-12-13 13:59:01,402 INFO L226 Difference]: Without dead ends: 311 [2022-12-13 13:59:01,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 133 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5121 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=3925, Invalid=13898, Unknown=3, NotChecked=264, Total=18090 [2022-12-13 13:59:01,405 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 2559 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2559 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:59:01,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2559 Valid, 804 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 691 Invalid, 0 Unknown, 133 Unchecked, 1.3s Time] [2022-12-13 13:59:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-12-13 13:59:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 95. [2022-12-13 13:59:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 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 13:59:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2022-12-13 13:59:01,417 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 56 [2022-12-13 13:59:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:59:01,418 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2022-12-13 13:59:01,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 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 13:59:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-12-13 13:59:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 13:59:01,418 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:59:01,418 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:59:01,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 13:59:01,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 13:59:01,620 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:59:01,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:59:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1512229753, now seen corresponding path program 3 times [2022-12-13 13:59:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:59:01,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654272237] [2022-12-13 13:59:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:59:01,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:59:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:59:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:59:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:59:02,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654272237] [2022-12-13 13:59:02,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654272237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:59:02,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812890979] [2022-12-13 13:59:02,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:59:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:59:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:59:02,788 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:59:02,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:59:03,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 13:59:03,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:59:03,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 108 conjunts are in the unsatisfiable core [2022-12-13 13:59:03,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:59:03,295 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 13:59:03,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 13:59:03,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:59:03,369 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 13:59:03,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 13:59:03,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-12-13 13:59:03,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:59:03,496 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:03,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:03,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,509 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 59 treesize of output 49 [2022-12-13 13:59:03,525 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-13 13:59:03,525 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 40 treesize of output 44 [2022-12-13 13:59:03,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,552 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-12-13 13:59:03,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-12-13 13:59:03,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,564 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 18 treesize of output 20 [2022-12-13 13:59:03,721 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:03,727 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:03,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-12-13 13:59:03,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,752 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 13:59:03,753 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 119 treesize of output 83 [2022-12-13 13:59:03,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:03,766 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-12-13 13:59:03,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-12-13 13:59:03,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-12-13 13:59:05,225 INFO L321 Elim1Store]: treesize reduction 252, result has 41.3 percent of original size [2022-12-13 13:59:05,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 297 treesize of output 305 [2022-12-13 13:59:05,521 INFO L321 Elim1Store]: treesize reduction 196, result has 46.3 percent of original size [2022-12-13 13:59:05,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 177 treesize of output 291 [2022-12-13 13:59:10,495 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-12-13 13:59:10,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 13:59:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:59:10,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:59:10,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:10,782 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 135 [2022-12-13 13:59:10,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:10,787 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 117 [2022-12-13 13:59:10,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:10,945 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 221 [2022-12-13 13:59:10,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:10,952 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 203 [2022-12-13 13:59:10,976 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_82 (Array Int Int)) (v_arrayElimArr_81 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_47| Int) (v_ArrVal_1087 (Array Int Int)) (v_arrayElimArr_84 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_arrayElimArr_83 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_81 0))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_83) |v_ULTIMATE.start_main_~l~0#1.base_47| v_arrayElimArr_82)) (.cse6 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_84) |v_ULTIMATE.start_main_~l~0#1.base_47| v_arrayElimArr_81))) (let ((.cse4 (select (select .cse6 .cse0) 0)) (.cse5 (select (select .cse3 .cse0) 0))) (let ((.cse1 (select (store (store |c_#memory_int| .cse0 v_ArrVal_1087) |v_ULTIMATE.start_main_~l~0#1.base_47| v_ArrVal_1097) (select (select .cse6 .cse4) .cse5))) (.cse2 (select (select .cse3 .cse4) .cse5))) (or (not (= (select v_arrayElimArr_83 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select v_arrayElimArr_84 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select v_arrayElimArr_82 0) 0)) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_47|) 0)) (not (= (select .cse1 (+ .cse2 4)) 0)) (not (= 2 (select .cse1 (+ .cse2 8)))))))))) is different from false [2022-12-13 13:59:11,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:11,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 303 [2022-12-13 13:59:11,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:11,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 219 [2022-12-13 13:59:11,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:11,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:11,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:11,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:11,128 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 107 [2022-12-13 13:59:11,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:11,136 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 689 treesize of output 649 [2022-12-13 13:59:11,142 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 682 treesize of output 572 [2022-12-13 13:59:11,150 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 466 [2022-12-13 13:59:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-12-13 13:59:11,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812890979] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:59:11,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:59:11,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 32 [2022-12-13 13:59:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990264712] [2022-12-13 13:59:11,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:59:11,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 13:59:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:59:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 13:59:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=836, Unknown=8, NotChecked=58, Total=992 [2022-12-13 13:59:11,503 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 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 13:59:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:59:28,591 INFO L93 Difference]: Finished difference Result 251 states and 302 transitions. [2022-12-13 13:59:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-12-13 13:59:28,592 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 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) Word has length 58 [2022-12-13 13:59:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:59:28,593 INFO L225 Difference]: With dead ends: 251 [2022-12-13 13:59:28,593 INFO L226 Difference]: Without dead ends: 249 [2022-12-13 13:59:28,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3033 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=2464, Invalid=8244, Unknown=8, NotChecked=204, Total=10920 [2022-12-13 13:59:28,595 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1206 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:59:28,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 579 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 619 Invalid, 0 Unknown, 117 Unchecked, 1.1s Time] [2022-12-13 13:59:28,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-12-13 13:59:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 106. [2022-12-13 13:59:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 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 13:59:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2022-12-13 13:59:28,609 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 58 [2022-12-13 13:59:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:59:28,609 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2022-12-13 13:59:28,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 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 13:59:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2022-12-13 13:59:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 13:59:28,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:59:28,610 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:59:28,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 13:59:28,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 13:59:28,812 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:59:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:59:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1492842773, now seen corresponding path program 7 times [2022-12-13 13:59:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:59:28,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720318092] [2022-12-13 13:59:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:59:28,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:59:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:59:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:59:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:59:29,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720318092] [2022-12-13 13:59:29,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720318092] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:59:29,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530809200] [2022-12-13 13:59:29,840 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 13:59:29,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:59:29,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:59:29,841 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:59:29,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:59:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:59:29,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 108 conjunts are in the unsatisfiable core [2022-12-13 13:59:29,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:59:29,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:59:29,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:59:30,000 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 13:59:30,062 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:30,066 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:30,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,075 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 13:59:30,090 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 13:59:30,090 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 18 treesize of output 28 [2022-12-13 13:59:30,116 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 13:59:30,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 13:59:30,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:30,224 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:30,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,238 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 13:59:30,238 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 56 treesize of output 52 [2022-12-13 13:59:30,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,256 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-13 13:59:30,256 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 33 treesize of output 50 [2022-12-13 13:59:30,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,285 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-12-13 13:59:30,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-12-13 13:59:30,443 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:30,448 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:30,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,472 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-12-13 13:59:30,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 86 [2022-12-13 13:59:30,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,493 INFO L321 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2022-12-13 13:59:30,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 76 [2022-12-13 13:59:30,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:30,522 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-12-13 13:59:30,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-12-13 13:59:31,790 INFO L321 Elim1Store]: treesize reduction 194, result has 10.2 percent of original size [2022-12-13 13:59:31,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 21 case distinctions, treesize of input 251 treesize of output 121 [2022-12-13 13:59:31,816 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-12-13 13:59:31,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 34 [2022-12-13 13:59:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:59:31,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:59:31,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:31,994 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 133 [2022-12-13 13:59:32,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:32,000 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 112 [2022-12-13 13:59:32,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:32,288 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 219 [2022-12-13 13:59:32,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:32,297 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 198 [2022-12-13 13:59:32,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:32,858 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 363 treesize of output 349 [2022-12-13 13:59:32,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:32,869 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 328 [2022-12-13 13:59:33,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:33,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 177 [2022-12-13 13:59:33,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,553 INFO L321 Elim1Store]: treesize reduction 769, result has 2.7 percent of original size [2022-12-13 13:59:33,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 39134 treesize of output 35744 [2022-12-13 13:59:33,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:33,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35716 treesize of output 23846 [2022-12-13 13:59:33,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,639 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 3560 treesize of output 3554 [2022-12-13 13:59:33,665 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 3602 treesize of output 2636 [2022-12-13 13:59:33,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,692 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 13:59:33,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2596 treesize of output 2410 [2022-12-13 13:59:33,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,770 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 13:59:33,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2276 treesize of output 1898 [2022-12-13 13:59:33,823 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 1228 treesize of output 1098 [2022-12-13 13:59:33,833 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 1089 treesize of output 977 [2022-12-13 13:59:33,851 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 13:59:33,851 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 956 treesize of output 874 [2022-12-13 13:59:33,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,874 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 13:59:33,874 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 28 treesize of output 22 [2022-12-13 13:59:33,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:33,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 189 [2022-12-13 13:59:33,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,897 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-12-13 13:59:33,898 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 2760 treesize of output 2680 [2022-12-13 13:59:33,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:59:33,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2676 treesize of output 1750 [2022-12-13 13:59:33,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:59:33,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 3820 treesize of output 3622 [2022-12-13 13:59:33,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:33,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3670 treesize of output 2608 [2022-12-13 13:59:33,973 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2568 treesize of output 2374 [2022-12-13 13:59:34,006 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2376 treesize of output 2278 [2022-12-13 13:59:34,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:34,031 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2320 treesize of output 2158 [2022-12-13 13:59:34,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:34,046 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2149 treesize of output 1681 [2022-12-13 13:59:34,079 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 13:59:34,079 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 37 treesize of output 31 [2022-12-13 13:59:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:59:34,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530809200] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:59:34,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:59:34,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2022-12-13 13:59:34,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150452502] [2022-12-13 13:59:34,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:59:34,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 13:59:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:59:34,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 13:59:34,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2022-12-13 13:59:34,139 INFO L87 Difference]: Start difference. First operand 106 states and 136 transitions. Second operand has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 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 13:59:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:59:36,232 INFO L93 Difference]: Finished difference Result 213 states and 265 transitions. [2022-12-13 13:59:36,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:59:36,233 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 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) Word has length 64 [2022-12-13 13:59:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:59:36,233 INFO L225 Difference]: With dead ends: 213 [2022-12-13 13:59:36,233 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 13:59:36,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 13:59:36,234 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 117 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:59:36,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1197 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 13:59:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 13:59:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2022-12-13 13:59:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3) internal successors, (143), 110 states have internal predecessors, (143), 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 13:59:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2022-12-13 13:59:36,249 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 64 [2022-12-13 13:59:36,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:59:36,249 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2022-12-13 13:59:36,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 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 13:59:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2022-12-13 13:59:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:59:36,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:59:36,249 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:59:36,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 13:59:36,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 13:59:36,451 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:59:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:59:36,452 INFO L85 PathProgramCache]: Analyzing trace with hash -377962859, now seen corresponding path program 8 times [2022-12-13 13:59:36,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:59:36,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708229781] [2022-12-13 13:59:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:59:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:59:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:59:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 23 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:59:38,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:59:38,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708229781] [2022-12-13 13:59:38,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708229781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:59:38,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119855616] [2022-12-13 13:59:38,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:59:38,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:59:38,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:59:38,176 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:59:38,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 13:59:38,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:59:38,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:59:38,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 134 conjunts are in the unsatisfiable core [2022-12-13 13:59:38,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:59:38,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 13:59:38,343 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 13:59:38,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:59:38,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:59:38,454 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 13:59:38,454 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 32 treesize of output 36 [2022-12-13 13:59:38,480 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 13:59:38,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 13:59:38,623 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:38,630 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:38,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,636 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 59 treesize of output 49 [2022-12-13 13:59:38,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 13:59:38,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,667 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-12-13 13:59:38,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-12-13 13:59:38,679 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 40 treesize of output 32 [2022-12-13 13:59:38,885 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:38,893 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:38,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,911 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 13:59:38,912 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 119 treesize of output 83 [2022-12-13 13:59:38,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,938 INFO L321 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2022-12-13 13:59:38,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 73 [2022-12-13 13:59:38,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:38,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-12-13 13:59:38,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-12-13 13:59:39,187 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:39,196 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 13:59:39,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,222 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-12-13 13:59:39,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 117 [2022-12-13 13:59:39,243 INFO L321 Elim1Store]: treesize reduction 43, result has 48.8 percent of original size [2022-12-13 13:59:39,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-12-13 13:59:39,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-12-13 13:59:39,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:59:39,282 INFO L321 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-12-13 13:59:39,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 36 [2022-12-13 13:59:42,835 INFO L321 Elim1Store]: treesize reduction 416, result has 54.4 percent of original size [2022-12-13 13:59:42,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 23 new quantified variables, introduced 78 case distinctions, treesize of input 495 treesize of output 689 [2022-12-13 13:59:43,632 INFO L321 Elim1Store]: treesize reduction 376, result has 54.0 percent of original size [2022-12-13 13:59:43,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 17 new quantified variables, introduced 78 case distinctions, treesize of input 575 treesize of output 799 [2022-12-13 14:03:04,021 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-12-13 14:03:04,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 14:03:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:03:04,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:03:04,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:03:04,664 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 307 treesize of output 271 [2022-12-13 14:03:04,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:03:04,669 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 229 [2022-12-13 14:03:04,686 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_109 (Array Int Int)) (v_arrayElimArr_110 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_64| Int) (v_ArrVal_1490 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_110)) (.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_109))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse7 (select (select .cse2 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse3 (select (select .cse5 .cse6) .cse7)) (.cse4 (select (select .cse2 .cse6) .cse7))) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_64| v_ArrVal_1490) (select (select .cse5 .cse3) .cse4))) (.cse1 (select (select .cse2 .cse3) .cse4))) (or (not (= (select .cse0 (+ .cse1 4)) 1)) (not (= (select v_arrayElimArr_109 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select .cse0 (+ .cse1 8)) 3)) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_110 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_64|) 0)))))))) is different from false [2022-12-13 14:03:04,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:03:04,772 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 521 treesize of output 485 [2022-12-13 14:03:04,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:03:04,780 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 479 treesize of output 443 [2022-12-13 14:03:04,809 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_109 (Array Int Int)) (v_arrayElimArr_110 (Array Int Int)) (v_arrayElimArr_112 (Array Int Int)) (v_arrayElimArr_111 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_64| Int) (v_ArrVal_1490 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_109 0))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse2 v_arrayElimArr_112) |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_110)) (.cse7 (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_111) |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_109)) (.cse3 (select v_arrayElimArr_110 0))) (let ((.cse8 (select (select .cse7 .cse2) .cse3)) (.cse9 (select (select .cse4 .cse2) .cse3))) (let ((.cse5 (select (select .cse7 .cse8) .cse9)) (.cse6 (select (select .cse4 .cse8) .cse9))) (let ((.cse0 (select (store (store |c_#memory_int| .cse2 v_ArrVal_1483) |v_ULTIMATE.start_main_~l~0#1.base_64| v_ArrVal_1490) (select (select .cse7 .cse5) .cse6))) (.cse1 (select (select .cse4 .cse5) .cse6))) (or (not (= 1 (select .cse0 (+ .cse1 4)))) (not (= 0 (select (store |c_#valid| .cse2 1) |v_ULTIMATE.start_main_~l~0#1.base_64|))) (not (= (select v_arrayElimArr_111 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select v_arrayElimArr_112 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select .cse0 (+ 8 .cse1)) 3)) (not (= .cse3 0)) (not (= (select |c_#valid| .cse2) 0))))))))) is different from false [2022-12-13 14:03:04,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:03:04,954 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 671 treesize of output 635 [2022-12-13 14:03:04,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:03:04,962 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 629 treesize of output 593 [2022-12-13 14:03:05,005 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_109 (Array Int Int)) (v_arrayElimArr_110 (Array Int Int)) (v_arrayElimArr_114 (Array Int Int)) (v_arrayElimArr_113 (Array Int Int)) (v_arrayElimArr_112 (Array Int Int)) (v_arrayElimArr_111 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_64| Int) (v_ArrVal_1471 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_111 0)) (.cse3 (select v_arrayElimArr_109 0))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_arrayElimArr_113) .cse3 v_arrayElimArr_112) |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_110)) (.cse9 (store (store (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_114) .cse3 v_arrayElimArr_111) |v_ULTIMATE.start_main_~l~0#1.base_64| v_arrayElimArr_109)) (.cse4 (select v_arrayElimArr_110 0))) (let ((.cse10 (select (select .cse9 .cse3) .cse4)) (.cse11 (select (select .cse6 .cse3) .cse4))) (let ((.cse7 (select (select .cse9 .cse10) .cse11)) (.cse8 (select (select .cse6 .cse10) .cse11))) (let ((.cse0 (select (store (store (store |c_#memory_int| .cse5 v_ArrVal_1471) .cse3 v_ArrVal_1483) |v_ULTIMATE.start_main_~l~0#1.base_64| v_ArrVal_1490) (select (select .cse9 .cse7) .cse8))) (.cse1 (select (select .cse6 .cse7) .cse8)) (.cse2 (store |c_#valid| .cse5 1))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_114 0))) (not (= (select v_arrayElimArr_113 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= 3 (select .cse0 (+ .cse1 8)))) (not (= (select .cse2 .cse3) 0)) (not (= (select v_arrayElimArr_112 0) 0)) (not (= (select .cse0 (+ .cse1 4)) 1)) (not (= .cse4 0)) (not (= (select (store .cse2 .cse3 1) |v_ULTIMATE.start_main_~l~0#1.base_64|) 0)) (not (= (select |c_#valid| .cse5) 0))))))))) is different from false [2022-12-13 14:03:05,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:03:05,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 989 treesize of output 805 [2022-12-13 14:03:05,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:03:05,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 793 treesize of output 609 [2022-12-13 14:03:05,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 191 [2022-12-13 14:03:05,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:03:05,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:03:05,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 71169 treesize of output 66087 [2022-12-13 14:03:05,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,620 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66111 treesize of output 64177 [2022-12-13 14:03:05,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:05,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64177 treesize of output 21157 [2022-12-13 14:03:06,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:06,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:06,384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20114 treesize of output 11696 [2022-12-13 14:03:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2022-12-13 14:03:08,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119855616] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:03:08,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:03:08,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 41 [2022-12-13 14:03:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281024041] [2022-12-13 14:03:08,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:03:08,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 14:03:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:03:08,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 14:03:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1311, Unknown=3, NotChecked=222, Total=1640 [2022-12-13 14:03:08,097 INFO L87 Difference]: Start difference. First operand 111 states and 143 transitions. Second operand has 41 states, 41 states have (on average 4.585365853658536) internal successors, (188), 41 states have internal predecessors, (188), 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 14:03:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:03:42,293 INFO L93 Difference]: Finished difference Result 312 states and 381 transitions. [2022-12-13 14:03:42,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-12-13 14:03:42,293 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.585365853658536) internal successors, (188), 41 states have internal predecessors, (188), 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) Word has length 69 [2022-12-13 14:03:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:03:42,295 INFO L225 Difference]: With dead ends: 312 [2022-12-13 14:03:42,295 INFO L226 Difference]: Without dead ends: 272 [2022-12-13 14:03:42,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 123 SyntacticMatches, 8 SemanticMatches, 115 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2944 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=2989, Invalid=9902, Unknown=3, NotChecked=678, Total=13572 [2022-12-13 14:03:42,297 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 2029 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 14:03:42,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 1138 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 852 Invalid, 0 Unknown, 401 Unchecked, 2.5s Time] [2022-12-13 14:03:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-12-13 14:03:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 111. [2022-12-13 14:03:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3) internal successors, (143), 110 states have internal predecessors, (143), 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 14:03:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2022-12-13 14:03:42,334 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 69 [2022-12-13 14:03:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:03:42,335 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2022-12-13 14:03:42,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.585365853658536) internal successors, (188), 41 states have internal predecessors, (188), 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 14:03:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2022-12-13 14:03:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 14:03:42,336 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:03:42,336 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:03:42,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 14:03:42,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:03:42,537 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:03:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:03:42,538 INFO L85 PathProgramCache]: Analyzing trace with hash -668441507, now seen corresponding path program 4 times [2022-12-13 14:03:42,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:03:42,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228032507] [2022-12-13 14:03:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:03:42,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:03:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:03:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 23 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:03:46,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:03:46,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228032507] [2022-12-13 14:03:46,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228032507] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:03:46,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8537191] [2022-12-13 14:03:46,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 14:03:46,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:03:46,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:03:46,290 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:03:46,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 14:03:46,450 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 14:03:46,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:03:46,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 136 conjunts are in the unsatisfiable core [2022-12-13 14:03:46,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:03:46,467 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 14:03:46,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:46,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:46,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 14:03:46,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:03:46,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:03:46,548 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 14:03:46,548 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 32 treesize of output 36 [2022-12-13 14:03:46,575 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 14:03:46,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 14:03:46,742 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:03:46,749 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:03:46,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:46,755 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 59 treesize of output 49 [2022-12-13 14:03:46,774 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-13 14:03:46,775 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 40 treesize of output 44 [2022-12-13 14:03:46,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:46,802 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-12-13 14:03:46,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-12-13 14:03:46,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:46,814 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 18 treesize of output 20 [2022-12-13 14:03:47,013 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:03:47,020 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:03:47,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,035 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 14:03:47,036 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 119 treesize of output 83 [2022-12-13 14:03:47,051 INFO L321 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2022-12-13 14:03:47,051 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 48 treesize of output 52 [2022-12-13 14:03:47,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,084 INFO L321 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2022-12-13 14:03:47,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 73 [2022-12-13 14:03:47,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-12-13 14:03:47,388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:03:47,396 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:03:47,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,425 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-12-13 14:03:47,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 117 [2022-12-13 14:03:47,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-12-13 14:03:47,467 INFO L321 Elim1Store]: treesize reduction 43, result has 48.8 percent of original size [2022-12-13 14:03:47,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-12-13 14:03:47,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:03:47,501 INFO L321 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-12-13 14:03:47,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 36 [2022-12-13 14:03:51,063 INFO L321 Elim1Store]: treesize reduction 424, result has 53.6 percent of original size [2022-12-13 14:03:51,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 23 new quantified variables, introduced 78 case distinctions, treesize of input 495 treesize of output 681 [2022-12-13 14:03:51,910 INFO L321 Elim1Store]: treesize reduction 384, result has 53.0 percent of original size [2022-12-13 14:03:51,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 17 new quantified variables, introduced 78 case distinctions, treesize of input 551 treesize of output 767 [2022-12-13 14:08:26,821 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2022-12-13 14:08:26,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 14:08:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 23 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:08:26,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:08:27,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:27,235 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 307 treesize of output 271 [2022-12-13 14:08:27,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:27,241 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 229 [2022-12-13 14:08:27,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:27,471 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 577 treesize of output 515 [2022-12-13 14:08:27,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:27,476 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 507 treesize of output 445 [2022-12-13 14:08:27,498 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_73| Int) (v_ArrVal_1697 (Array Int Int)) (v_arrayElimArr_125 (Array Int Int)) (v_arrayElimArr_124 (Array Int Int)) (v_arrayElimArr_123 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_arrayElimArr_126 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_123 0))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_126) |v_ULTIMATE.start_main_~l~0#1.base_73| v_arrayElimArr_124)) (.cse7 (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_125) |v_ULTIMATE.start_main_~l~0#1.base_73| v_arrayElimArr_123)) (.cse2 (select v_arrayElimArr_124 0))) (let ((.cse8 (select (select .cse7 .cse3) .cse2)) (.cse9 (select (select .cse4 .cse3) .cse2))) (let ((.cse5 (select (select .cse7 .cse8) .cse9)) (.cse6 (select (select .cse4 .cse8) .cse9))) (let ((.cse0 (select (store (store |c_#memory_int| .cse3 v_ArrVal_1697) |v_ULTIMATE.start_main_~l~0#1.base_73| v_ArrVal_1709) (select (select .cse7 .cse5) .cse6))) (.cse1 (select (select .cse4 .cse5) .cse6))) (or (not (= (select .cse0 (+ .cse1 8)) 2)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_125 .cse2))) (not (= (select v_arrayElimArr_126 .cse2) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= 0 (select |c_#valid| .cse3))) (not (= .cse2 0)) (not (= (select .cse0 (+ .cse1 4)) 0)) (not (= (select (store |c_#valid| .cse3 1) |v_ULTIMATE.start_main_~l~0#1.base_73|) 0))))))))) is different from false [2022-12-13 14:08:27,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:27,644 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 731 treesize of output 695 [2022-12-13 14:08:27,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:27,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 689 treesize of output 653 [2022-12-13 14:08:27,704 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_73| Int) (v_ArrVal_1697 (Array Int Int)) (v_arrayElimArr_125 (Array Int Int)) (v_arrayElimArr_124 (Array Int Int)) (v_arrayElimArr_123 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_arrayElimArr_128 (Array Int Int)) (v_arrayElimArr_127 (Array Int Int)) (v_arrayElimArr_126 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_124 0))) (let ((.cse5 (select v_arrayElimArr_125 .cse4)) (.cse3 (select v_arrayElimArr_123 0))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_arrayElimArr_127) .cse3 v_arrayElimArr_126) |v_ULTIMATE.start_main_~l~0#1.base_73| v_arrayElimArr_124)) (.cse9 (store (store (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_128) .cse3 v_arrayElimArr_125) |v_ULTIMATE.start_main_~l~0#1.base_73| v_arrayElimArr_123))) (let ((.cse10 (select (select .cse9 .cse3) .cse4)) (.cse11 (select (select .cse6 .cse3) .cse4))) (let ((.cse7 (select (select .cse9 .cse10) .cse11)) (.cse8 (select (select .cse6 .cse10) .cse11))) (let ((.cse2 (store |c_#valid| .cse5 1)) (.cse0 (select (store (store (store |c_#memory_int| .cse5 v_ArrVal_1691) .cse3 v_ArrVal_1697) |v_ULTIMATE.start_main_~l~0#1.base_73| v_ArrVal_1709) (select (select .cse9 .cse7) .cse8))) (.cse1 (select (select .cse6 .cse7) .cse8))) (or (not (= (select .cse0 (+ 8 .cse1)) 2)) (not (= (select (store .cse2 .cse3 1) |v_ULTIMATE.start_main_~l~0#1.base_73|) 0)) (not (= (select .cse2 .cse3) 0)) (not (= (select v_arrayElimArr_128 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= .cse4 0)) (not (= (select v_arrayElimArr_127 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select v_arrayElimArr_126 .cse4) 0)) (not (= (select .cse0 (+ .cse1 4)) 0)) (not (= (select |c_#valid| .cse5) 0)))))))))) is different from false [2022-12-13 14:08:27,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:27,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 993 treesize of output 835 [2022-12-13 14:08:27,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:27,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 825 treesize of output 667 [2022-12-13 14:08:27,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:27,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:27,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:27,962 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 207 [2022-12-13 14:08:27,968 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 275 treesize of output 237 [2022-12-13 14:08:27,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:27,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:27,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:08:27,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 13583 treesize of output 13193 [2022-12-13 14:08:28,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:28,060 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13249 treesize of output 12617 [2022-12-13 14:08:28,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:28,119 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12611 treesize of output 9565 [2022-12-13 14:08:28,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:28,314 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9484 treesize of output 6448 [2022-12-13 14:08:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 23 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-12-13 14:08:29,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8537191] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:08:29,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:08:29,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 15] total 40 [2022-12-13 14:08:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546873790] [2022-12-13 14:08:29,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:08:29,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 14:08:29,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:08:29,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 14:08:29,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1297, Unknown=7, NotChecked=146, Total=1560 [2022-12-13 14:08:29,500 INFO L87 Difference]: Start difference. First operand 111 states and 143 transitions. Second operand has 40 states, 40 states have (on average 4.275) internal successors, (171), 40 states have internal predecessors, (171), 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 14:08:47,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:08:47,918 INFO L93 Difference]: Finished difference Result 156 states and 190 transitions. [2022-12-13 14:08:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 14:08:47,919 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.275) internal successors, (171), 40 states have internal predecessors, (171), 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) Word has length 71 [2022-12-13 14:08:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:08:47,919 INFO L225 Difference]: With dead ends: 156 [2022-12-13 14:08:47,919 INFO L226 Difference]: Without dead ends: 154 [2022-12-13 14:08:47,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=1549, Invalid=5258, Unknown=7, NotChecked=326, Total=7140 [2022-12-13 14:08:47,920 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 746 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:08:47,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 998 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 823 Invalid, 0 Unknown, 172 Unchecked, 2.3s Time] [2022-12-13 14:08:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-12-13 14:08:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 122. [2022-12-13 14:08:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 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 14:08:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 156 transitions. [2022-12-13 14:08:47,945 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 156 transitions. Word has length 71 [2022-12-13 14:08:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:08:47,945 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 156 transitions. [2022-12-13 14:08:47,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.275) internal successors, (171), 40 states have internal predecessors, (171), 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 14:08:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 156 transitions. [2022-12-13 14:08:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 14:08:47,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:08:47,945 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:08:47,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 14:08:48,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 14:08:48,147 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 14:08:48,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:08:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash 845577793, now seen corresponding path program 9 times [2022-12-13 14:08:48,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:08:48,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462104986] [2022-12-13 14:08:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:08:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:08:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:08:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 20 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:08:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:08:49,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462104986] [2022-12-13 14:08:49,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462104986] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:08:49,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860823067] [2022-12-13 14:08:49,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 14:08:49,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:08:49,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:08:49,751 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:08:49,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b66d9eab-96a3-4cfb-9e35-325f5b1547d8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 14:08:50,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 14:08:50,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:08:50,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 166 conjunts are in the unsatisfiable core [2022-12-13 14:08:50,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:08:50,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:08:50,797 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 14:08:50,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:08:50,867 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:08:50,872 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:08:50,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:50,877 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 14:08:50,895 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 14:08:50,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 14:08:50,903 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 18 treesize of output 20 [2022-12-13 14:08:50,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:50,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:50,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 14:08:51,008 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:08:51,013 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:08:51,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-12-13 14:08:51,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,035 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 14:08:51,035 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 56 treesize of output 52 [2022-12-13 14:08:51,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,060 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-12-13 14:08:51,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-12-13 14:08:51,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 14:08:51,277 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:08:51,284 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:08:51,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,310 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-12-13 14:08:51,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 86 [2022-12-13 14:08:51,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,335 INFO L321 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2022-12-13 14:08:51,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 73 [2022-12-13 14:08:51,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-12-13 14:08:51,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-12-13 14:08:51,653 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:08:51,660 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-13 14:08:51,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,695 INFO L321 Elim1Store]: treesize reduction 96, result has 14.3 percent of original size [2022-12-13 14:08:51,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 225 treesize of output 141 [2022-12-13 14:08:51,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,702 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 40 treesize of output 32 [2022-12-13 14:08:51,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,722 INFO L321 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-12-13 14:08:51,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 36 [2022-12-13 14:08:51,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:08:51,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 86 [2022-12-13 14:08:55,521 INFO L321 Elim1Store]: treesize reduction 343, result has 9.7 percent of original size [2022-12-13 14:08:55,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 19 new quantified variables, introduced 36 case distinctions, treesize of input 565 treesize of output 223 [2022-12-13 14:08:55,556 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-13 14:08:55,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 62 [2022-12-13 14:08:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 20 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:08:55,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:08:56,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:56,945 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 726 treesize of output 630 [2022-12-13 14:08:56,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:56,952 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 624 treesize of output 528 [2022-12-13 14:08:57,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:57,607 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1523 treesize of output 1371 [2022-12-13 14:08:57,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:57,617 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1364 treesize of output 1212 [2022-12-13 14:08:58,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:58,650 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2313 treesize of output 2161 [2022-12-13 14:08:58,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:08:58,664 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2154 treesize of output 2002 [2022-12-13 14:09:01,169 INFO L321 Elim1Store]: treesize reduction 84, result has 64.3 percent of original size [2022-12-13 14:09:01,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 3095 treesize of output 3002 [2022-12-13 14:09:01,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:09:01,193 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2831 treesize of output 2679 [2022-12-13 14:09:01,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:09:01,237 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2716 treesize of output 2564 [2022-12-13 14:09:04,783 INFO L321 Elim1Store]: treesize reduction 1673, result has 88.8 percent of original size [2022-12-13 14:09:04,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 42 case distinctions, treesize of input 36434113 treesize of output 36083241 [2022-12-13 14:09:22,349 WARN L233 SmtUtils]: Spent 17.56s on a formula simplification. DAG size of input: 2799 DAG size of output: 2784 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:09:23,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:09:23,711 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 36069747 treesize of output 33133748 [2022-12-13 14:09:32,454 WARN L233 SmtUtils]: Spent 8.74s on a formula simplification that was a NOOP. DAG size: 2792 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:09:34,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:09:34,202 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 33132915 treesize of output 27260084 [2022-12-13 14:09:42,982 WARN L233 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 2800 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:09:45,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:09:45,313 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 27259251 treesize of output 27259256 [2022-12-13 14:09:54,121 WARN L233 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 2808 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:09:56,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:09:56,586 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 27258423 treesize of output 27257600 [2022-12-13 14:10:05,469 WARN L233 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 2816 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:10:35,275 WARN L233 SmtUtils]: Spent 16.94s on a formula simplification that was a NOOP. DAG size: 2575 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:10:52,192 WARN L233 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 2566 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)