./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/conda.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/conda.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4382625030c70271d5cb32641146c4ec68928c0500a545b71e51fae395fc6041 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:46:05,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:46:05,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:46:05,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:46:05,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:46:05,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:46:05,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:46:05,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:46:05,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:46:05,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:46:05,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:46:05,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:46:05,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:46:05,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:46:05,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:46:05,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:46:05,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:46:05,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:46:05,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:46:05,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:46:05,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:46:05,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:46:05,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:46:05,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:46:05,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:46:05,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:46:05,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:46:05,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:46:05,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:46:05,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:46:05,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:46:05,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:46:05,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:46:05,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:46:05,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:46:05,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:46:05,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:46:05,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:46:05,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:46:05,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:46:05,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:46:05,637 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:46:05,672 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:46:05,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:46:05,673 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:46:05,674 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:46:05,674 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:46:05,675 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:46:05,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:46:05,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:46:05,676 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:46:05,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:46:05,677 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:46:05,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:46:05,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:46:05,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:46:05,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:46:05,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:46:05,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:46:05,679 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:46:05,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:46:05,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:46:05,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:46:05,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:46:05,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:46:05,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:46:05,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:46:05,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:46:05,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:46:05,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:46:05,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:46:05,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:46:05,682 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:46:05,683 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:46:05,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:46:05,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4382625030c70271d5cb32641146c4ec68928c0500a545b71e51fae395fc6041 [2022-11-21 16:46:05,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:46:05,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:46:05,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:46:05,989 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:46:05,990 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:46:05,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/array-fpi/conda.c [2022-11-21 16:46:09,072 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:46:09,286 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:46:09,286 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/sv-benchmarks/c/array-fpi/conda.c [2022-11-21 16:46:09,293 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/data/a745d1ea2/313c6310cf6d47f191bec0b1c8d4e08c/FLAG3a7c69af2 [2022-11-21 16:46:09,307 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/data/a745d1ea2/313c6310cf6d47f191bec0b1c8d4e08c [2022-11-21 16:46:09,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:46:09,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:46:09,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:46:09,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:46:09,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:46:09,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23bbcdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09, skipping insertion in model container [2022-11-21 16:46:09,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:46:09,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:46:09,512 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_14343e9e-1a86-4846-adaf-8dc05bbaa004/sv-benchmarks/c/array-fpi/conda.c[588,601] [2022-11-21 16:46:09,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:46:09,547 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:46:09,558 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_14343e9e-1a86-4846-adaf-8dc05bbaa004/sv-benchmarks/c/array-fpi/conda.c[588,601] [2022-11-21 16:46:09,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:46:09,584 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:46:09,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09 WrapperNode [2022-11-21 16:46:09,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:46:09,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:46:09,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:46:09,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:46:09,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,632 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-11-21 16:46:09,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:46:09,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:46:09,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:46:09,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:46:09,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,669 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:46:09,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:46:09,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:46:09,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:46:09,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (1/1) ... [2022-11-21 16:46:09,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:46:09,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:46:09,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:46:09,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:46:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:46:09,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:46:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:46:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:46:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:46:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:46:09,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:46:09,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:46:09,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:46:09,866 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:46:09,868 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:46:10,102 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:46:10,108 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:46:10,108 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 16:46:10,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:46:10 BoogieIcfgContainer [2022-11-21 16:46:10,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:46:10,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:46:10,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:46:10,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:46:10,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:46:09" (1/3) ... [2022-11-21 16:46:10,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4b9ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:46:10, skipping insertion in model container [2022-11-21 16:46:10,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:46:09" (2/3) ... [2022-11-21 16:46:10,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4b9ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:46:10, skipping insertion in model container [2022-11-21 16:46:10,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:46:10" (3/3) ... [2022-11-21 16:46:10,129 INFO L112 eAbstractionObserver]: Analyzing ICFG conda.c [2022-11-21 16:46:10,153 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:46:10,154 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:46:10,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:46:10,227 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;@27fb7b3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:46:10,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:46:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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-11-21 16:46:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:46:10,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:10,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:46:10,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:10,251 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-11-21 16:46:10,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:46:10,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507368787] [2022-11-21 16:46:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:46:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:10,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:46:10,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507368787] [2022-11-21 16:46:10,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507368787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:10,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:10,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:46:10,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282439246] [2022-11-21 16:46:10,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:10,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:46:10,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:46:10,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:46:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:46:10,535 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:10,580 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-11-21 16:46:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:46:10,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-11-21 16:46:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:10,590 INFO L225 Difference]: With dead ends: 40 [2022-11-21 16:46:10,591 INFO L226 Difference]: Without dead ends: 18 [2022-11-21 16:46:10,593 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-11-21 16:46:10,599 INFO L413 NwaCegarLoop]: 26 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, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:10,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:46:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-21 16:46:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-21 16:46:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-21 16:46:10,637 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-11-21 16:46:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:10,638 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-21 16:46:10,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-21 16:46:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:46:10,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:10,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:46:10,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:46:10,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:10,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-11-21 16:46:10,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:46:10,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099102792] [2022-11-21 16:46:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:10,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:46:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:10,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:46:10,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099102792] [2022-11-21 16:46:10,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099102792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:46:10,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:46:10,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:46:10,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928997847] [2022-11-21 16:46:10,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:46:10,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:46:10,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:46:10,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:46:10,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:46:10,883 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:10,990 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-11-21 16:46:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:46:10,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-11-21 16:46:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:10,997 INFO L225 Difference]: With dead ends: 36 [2022-11-21 16:46:10,997 INFO L226 Difference]: Without dead ends: 25 [2022-11-21 16:46:10,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:46:10,999 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:11,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:46:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-21 16:46:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-21 16:46:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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-11-21 16:46:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-21 16:46:11,006 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-11-21 16:46:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:11,006 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-21 16:46:11,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-21 16:46:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 16:46:11,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:11,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:46:11,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:46:11,008 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:11,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-11-21 16:46:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:46:11,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426185564] [2022-11-21 16:46:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:46:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:12,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:46:12,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426185564] [2022-11-21 16:46:12,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426185564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:46:12,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686664595] [2022-11-21 16:46:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:12,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:46:12,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:46:12,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:46:12,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:46:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:12,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-21 16:46:12,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:12,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-21 16:46:12,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:46:12,665 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 14 treesize of output 16 [2022-11-21 16:46:12,874 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-21 16:46:13,013 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-21 16:46:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:13,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:46:13,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:46:13,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-11-21 16:46:13,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:46:13,587 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 25 [2022-11-21 16:46:13,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:46:13,594 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 22 treesize of output 14 [2022-11-21 16:46:13,599 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 14 treesize of output 10 [2022-11-21 16:46:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:13,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686664595] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:46:13,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:46:13,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-11-21 16:46:13,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218881568] [2022-11-21 16:46:13,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:46:13,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-21 16:46:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:46:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-21 16:46:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2022-11-21 16:46:13,617 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:14,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:14,688 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-11-21 16:46:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 16:46:14,688 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 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 20 [2022-11-21 16:46:14,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:14,691 INFO L225 Difference]: With dead ends: 53 [2022-11-21 16:46:14,691 INFO L226 Difference]: Without dead ends: 49 [2022-11-21 16:46:14,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=405, Invalid=1401, Unknown=0, NotChecked=0, Total=1806 [2022-11-21 16:46:14,693 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 78 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:14,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 80 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:46:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-21 16:46:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2022-11-21 16:46:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-21 16:46:14,703 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-11-21 16:46:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:14,704 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-21 16:46:14,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-11-21 16:46:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 16:46:14,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:14,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:46:14,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:14,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:46:14,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:14,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:14,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-11-21 16:46:14,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:46:14,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913169258] [2022-11-21 16:46:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:14,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:46:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:46:15,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:46:15,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913169258] [2022-11-21 16:46:15,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913169258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:46:15,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87419878] [2022-11-21 16:46:15,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:15,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:46:15,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:46:15,168 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:46:15,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:46:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:15,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 16:46:15,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:15,260 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 18 treesize of output 14 [2022-11-21 16:46:15,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:46:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:46:15,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:46:15,327 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 14 treesize of output 12 [2022-11-21 16:46:15,330 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 18 treesize of output 16 [2022-11-21 16:46:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:46:15,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87419878] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:46:15,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:46:15,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-21 16:46:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399498167] [2022-11-21 16:46:15,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:46:15,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:46:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:46:15,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:46:15,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:46:15,344 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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-11-21 16:46:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:15,446 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-11-21 16:46:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:46:15,446 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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) Word has length 20 [2022-11-21 16:46:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:15,447 INFO L225 Difference]: With dead ends: 48 [2022-11-21 16:46:15,447 INFO L226 Difference]: Without dead ends: 37 [2022-11-21 16:46:15,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:46:15,449 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:15,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 55 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:46:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-21 16:46:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-11-21 16:46:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 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-11-21 16:46:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-21 16:46:15,459 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-11-21 16:46:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:15,459 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-21 16:46:15,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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-11-21 16:46:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-21 16:46:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:46:15,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:15,461 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:46:15,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:15,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:46:15,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-11-21 16:46:15,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:46:15,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634931539] [2022-11-21 16:46:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:46:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:46:15,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:46:15,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634931539] [2022-11-21 16:46:15,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634931539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:46:15,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033588345] [2022-11-21 16:46:15,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:46:15,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:46:15,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:46:15,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:46:15,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:46:15,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:46:15,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:46:15,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:46:15,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:46:15,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:46:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:46:15,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033588345] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:46:15,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:46:15,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-21 16:46:15,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219619661] [2022-11-21 16:46:15,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:46:15,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:46:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:46:15,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:46:15,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:46:15,942 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:16,065 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-11-21 16:46:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:46:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 22 [2022-11-21 16:46:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:16,066 INFO L225 Difference]: With dead ends: 70 [2022-11-21 16:46:16,066 INFO L226 Difference]: Without dead ends: 44 [2022-11-21 16:46:16,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:46:16,068 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:16,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 27 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:46:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-21 16:46:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-11-21 16:46:16,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-21 16:46:16,078 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-11-21 16:46:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:16,078 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-21 16:46:16,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-21 16:46:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:46:16,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:16,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:46:16,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:16,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:46:16,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:16,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:16,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-11-21 16:46:16,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:46:16,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782207253] [2022-11-21 16:46:16,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:16,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:46:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:46:16,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:46:16,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782207253] [2022-11-21 16:46:16,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782207253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:46:16,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652550854] [2022-11-21 16:46:16,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:46:16,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:46:16,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:46:16,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:46:16,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:46:16,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-21 16:46:16,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:46:16,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:46:16,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:46:16,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:46:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:46:16,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652550854] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:46:16,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:46:16,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-21 16:46:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699520799] [2022-11-21 16:46:16,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:46:16,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:46:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:46:16,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:46:16,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:46:16,649 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-11-21 16:46:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:46:16,795 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-11-21 16:46:16,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:46:16,796 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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 22 [2022-11-21 16:46:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:46:16,799 INFO L225 Difference]: With dead ends: 39 [2022-11-21 16:46:16,800 INFO L226 Difference]: Without dead ends: 31 [2022-11-21 16:46:16,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:46:16,803 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:46:16,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 24 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:46:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-21 16:46:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-21 16:46:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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-11-21 16:46:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-21 16:46:16,821 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-11-21 16:46:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:46:16,821 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-21 16:46:16,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-11-21 16:46:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-21 16:46:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 16:46:16,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:46:16,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:46:16,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:46:17,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 16:46:17,028 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:46:17,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:46:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-11-21 16:46:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:46:17,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15050377] [2022-11-21 16:46:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:46:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:46:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:46:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:18,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:46:18,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15050377] [2022-11-21 16:46:18,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15050377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:46:18,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370172609] [2022-11-21 16:46:18,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:46:18,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:46:18,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:46:18,906 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:46:18,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:46:18,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:46:18,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:46:18,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-21 16:46:19,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:46:19,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-21 16:46:19,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:46:19,065 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 14 treesize of output 16 [2022-11-21 16:46:19,118 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 14 treesize of output 16 [2022-11-21 16:46:19,315 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-21 16:46:19,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:19,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 45 treesize of output 35 [2022-11-21 16:46:19,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:46:19,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 62 treesize of output 40 [2022-11-21 16:46:19,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 54 treesize of output 36 [2022-11-21 16:46:19,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 59 treesize of output 31 [2022-11-21 16:46:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:19,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:46:21,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:46:21,378 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2022-11-21 16:46:29,998 WARN L233 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:46:40,094 WARN L233 SmtUtils]: Spent 9.81s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:46:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:46:40,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370172609] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:46:40,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:46:40,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 48 [2022-11-21 16:46:40,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286881959] [2022-11-21 16:46:40,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:46:40,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-21 16:46:40,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:46:40,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-21 16:46:40,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2022-11-21 16:46:40,216 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:46:53,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:47:19,837 WARN L233 SmtUtils]: Spent 25.42s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:47:22,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:47:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:41,688 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2022-11-21 16:47:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-21 16:47:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 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 27 [2022-11-21 16:47:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:41,689 INFO L225 Difference]: With dead ends: 91 [2022-11-21 16:47:41,689 INFO L226 Difference]: Without dead ends: 74 [2022-11-21 16:47:41,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1676 ImplicationChecksByTransitivity, 73.8s TimeCoverageRelationStatistics Valid=882, Invalid=4970, Unknown=0, NotChecked=0, Total=5852 [2022-11-21 16:47:41,691 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 123 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 184 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:41,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 117 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 708 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-11-21 16:47:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-21 16:47:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 44. [2022-11-21 16:47:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:47:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-11-21 16:47:41,704 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 27 [2022-11-21 16:47:41,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:41,704 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-11-21 16:47:41,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:47:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-11-21 16:47:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 16:47:41,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:41,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:47:41,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-21 16:47:41,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:47:41,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:41,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-11-21 16:47:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:41,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974179036] [2022-11-21 16:47:41,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:47:43,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:43,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974179036] [2022-11-21 16:47:43,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974179036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:47:43,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628504307] [2022-11-21 16:47:43,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:43,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:47:43,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:47:43,041 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:47:43,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:47:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:43,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-21 16:47:43,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:43,257 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 15 treesize of output 11 [2022-11-21 16:47:43,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:47:43,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 23 treesize of output 22 [2022-11-21 16:47:43,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-21 16:47:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:47:43,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:47:43,912 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 14 [2022-11-21 16:47:43,922 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 20 treesize of output 16 [2022-11-21 16:47:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:47:44,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628504307] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:47:44,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:47:44,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-11-21 16:47:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462720796] [2022-11-21 16:47:44,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:47:44,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:47:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:44,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:47:44,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:47:44,143 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:47:45,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:45,195 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-11-21 16:47:45,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:47:45,196 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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 27 [2022-11-21 16:47:45,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:45,197 INFO L225 Difference]: With dead ends: 74 [2022-11-21 16:47:45,197 INFO L226 Difference]: Without dead ends: 52 [2022-11-21 16:47:45,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:47:45,198 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:45,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 59 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:47:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-21 16:47:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-11-21 16:47:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:47:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-11-21 16:47:45,213 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 27 [2022-11-21 16:47:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:45,213 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-11-21 16:47:45,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:47:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-11-21 16:47:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 16:47:45,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:45,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:47:45,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-21 16:47:45,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:47:45,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-11-21 16:47:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:45,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341075354] [2022-11-21 16:47:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:47:45,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:45,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341075354] [2022-11-21 16:47:45,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341075354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:47:45,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286794704] [2022-11-21 16:47:45,853 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 16:47:45,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:47:45,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:47:45,854 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:47:45,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:47:45,960 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-21 16:47:45,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:47:45,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:47:45,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:47:46,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:47:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:47:47,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286794704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:47:47,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:47:47,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-21 16:47:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702036255] [2022-11-21 16:47:47,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:47:47,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:47:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:47,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:47:47,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:47:47,050 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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-11-21 16:47:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:47,986 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-11-21 16:47:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:47:47,987 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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 29 [2022-11-21 16:47:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:47,988 INFO L225 Difference]: With dead ends: 86 [2022-11-21 16:47:47,988 INFO L226 Difference]: Without dead ends: 53 [2022-11-21 16:47:47,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:47:47,989 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:47,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 29 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:47:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-21 16:47:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-11-21 16:47:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:47:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-21 16:47:48,012 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-11-21 16:47:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:48,012 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-21 16:47:48,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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-11-21 16:47:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-21 16:47:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 16:47:48,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:48,014 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:47:48,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:48,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-21 16:47:48,220 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:48,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-11-21 16:47:48,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:48,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232366066] [2022-11-21 16:47:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:48,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:47:48,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:48,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232366066] [2022-11-21 16:47:48,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232366066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:47:48,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999359434] [2022-11-21 16:47:48,705 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 16:47:48,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:47:48,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:47:48,706 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:47:48,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:47:48,797 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-21 16:47:48,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:47:48,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:47:48,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:47:49,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:47:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:47:49,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999359434] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:47:49,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:47:49,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-21 16:47:49,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43038490] [2022-11-21 16:47:49,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:47:49,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:47:49,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:47:49,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:47:49,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:47:49,784 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:47:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:47:50,731 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-11-21 16:47:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:47:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 29 [2022-11-21 16:47:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:47:50,732 INFO L225 Difference]: With dead ends: 48 [2022-11-21 16:47:50,732 INFO L226 Difference]: Without dead ends: 38 [2022-11-21 16:47:50,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-21 16:47:50,734 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 92 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:47:50,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 21 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:47:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-21 16:47:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-21 16:47:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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-11-21 16:47:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-21 16:47:50,745 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-11-21 16:47:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:47:50,745 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-21 16:47:50,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:47:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-21 16:47:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 16:47:50,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:47:50,746 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:47:50,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:47:50,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:47:50,953 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:47:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:47:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-11-21 16:47:50,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:47:50,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816259956] [2022-11-21 16:47:50,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:47:50,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:47:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:47:59,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:47:59,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816259956] [2022-11-21 16:47:59,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816259956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:47:59,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696571048] [2022-11-21 16:47:59,660 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 16:47:59,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:47:59,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:47:59,661 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:47:59,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 16:47:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:47:59,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-21 16:47:59,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:47:59,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:47:59,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 10 treesize of output 8 [2022-11-21 16:48:00,101 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 14 treesize of output 16 [2022-11-21 16:48:00,402 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 14 treesize of output 16 [2022-11-21 16:48:00,673 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 14 treesize of output 16 [2022-11-21 16:48:01,923 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-21 16:48:02,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:02,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 51 treesize of output 37 [2022-11-21 16:48:03,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:03,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:03,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 73 [2022-11-21 16:48:04,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:48:04,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:04,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:04,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 77 [2022-11-21 16:48:05,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:05,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:05,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:05,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:48:05,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 69 [2022-11-21 16:48:06,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 55 [2022-11-21 16:48:07,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 46 [2022-11-21 16:48:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:48:07,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:48:17,879 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:48:17,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2022-11-21 16:48:20,189 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 2)) (not (= (select v_arrayElimArr_4 .cse1) 2)) (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5))))) (+ .cse7 3)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (not (= (select v_arrayElimArr_4 .cse1) 2)) (< (+ .cse7 1) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12)))))) (not (= 2 (select v_arrayElimArr_4 .cse6)))))))) is different from false [2022-11-21 16:48:23,630 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse0 3) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (not (= .cse1 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12))))) (+ .cse0 5)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))))) is different from false [2022-11-21 16:48:26,716 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse0 5) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (not (= .cse1 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12))))) (+ .cse0 7)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))))) is different from false [2022-11-21 16:48:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-21 16:48:26,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696571048] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:48:26,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:48:26,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 65 [2022-11-21 16:48:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120418556] [2022-11-21 16:48:26,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:48:26,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-21 16:48:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:26,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-21 16:48:26,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=3320, Unknown=3, NotChecked=366, Total=4160 [2022-11-21 16:48:26,938 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:48:30,728 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse9 .cse8)) (.cse0 (select .cse9 .cse7)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 1)) (not (= .cse1 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 2) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 1)) .cse8 (+ .cse1 1)) .cse7 (+ .cse0 1))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6 1)))))) (not (= .cse6 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse10 5) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15)))))) (not (= .cse11 2)) (not (= (select v_arrayElimArr_4 .cse8) 2)) (not (= 2 (select v_arrayElimArr_4 .cse7)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse16 2)) (not (= (select v_arrayElimArr_4 .cse8) 2)) (< (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse19 .cse20))))) (+ .cse10 7)) (not (= 2 (select v_arrayElimArr_4 .cse7)))))))) is different from false [2022-11-21 16:48:33,791 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ .cse0 3) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (not (= .cse1 2)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse8 2)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse11 .cse12))))) (+ .cse0 5)) (not (= (select v_arrayElimArr_4 .cse7) 2)) (not (= 2 (select v_arrayElimArr_4 .cse6)))))) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (select .cse20 .cse7)) (.cse13 (select .cse20 .cse6)) (.cse19 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse13 1)) (not (= .cse14 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 2) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse19 1)) .cse7 (+ .cse14 1)) .cse6 (+ .cse13 1))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse18 .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse18 .cse19 1)))))) (not (= .cse19 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-21 16:48:50,077 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 104 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:49:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:00,191 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-11-21 16:49:00,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-21 16:49:00,192 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 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 34 [2022-11-21 16:49:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:00,193 INFO L225 Difference]: With dead ends: 82 [2022-11-21 16:49:00,193 INFO L226 Difference]: Without dead ends: 78 [2022-11-21 16:49:00,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1868 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=636, Invalid=4349, Unknown=5, NotChecked=710, Total=5700 [2022-11-21 16:49:00,197 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 115 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:00,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 191 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1067 Invalid, 0 Unknown, 122 Unchecked, 9.3s Time] [2022-11-21 16:49:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-21 16:49:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2022-11-21 16:49:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-11-21 16:49:00,236 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2022-11-21 16:49:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:00,238 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-11-21 16:49:00,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-11-21 16:49:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 16:49:00,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:00,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:00,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:49:00,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-21 16:49:00,445 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:49:00,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-11-21 16:49:00,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:00,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810362709] [2022-11-21 16:49:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:49:02,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:02,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810362709] [2022-11-21 16:49:02,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810362709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:49:02,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076391108] [2022-11-21 16:49:02,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:49:02,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:49:02,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:49:02,058 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:49:02,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 16:49:02,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:49:02,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:49:02,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-21 16:49:02,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:49:02,747 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 13 treesize of output 9 [2022-11-21 16:49:03,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:03,247 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 25 treesize of output 24 [2022-11-21 16:49:03,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:03,483 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 25 treesize of output 24 [2022-11-21 16:49:03,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:49:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:49:03,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:49:04,363 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 14 [2022-11-21 16:49:04,374 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 20 treesize of output 16 [2022-11-21 16:49:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:49:04,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076391108] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:49:04,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:49:04,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-11-21 16:49:04,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565976348] [2022-11-21 16:49:04,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:49:04,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-21 16:49:04,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:04,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-21 16:49:04,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-11-21 16:49:04,698 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:08,053 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-11-21 16:49:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 16:49:08,053 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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 34 [2022-11-21 16:49:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:08,054 INFO L225 Difference]: With dead ends: 76 [2022-11-21 16:49:08,054 INFO L226 Difference]: Without dead ends: 61 [2022-11-21 16:49:08,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-11-21 16:49:08,056 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:08,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 70 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-21 16:49:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-21 16:49:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-11-21 16:49:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-21 16:49:08,074 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 34 [2022-11-21 16:49:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:08,075 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-21 16:49:08,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-21 16:49:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 16:49:08,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:08,077 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:08,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-21 16:49:08,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:49:08,283 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:49:08,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-11-21 16:49:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:08,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299075946] [2022-11-21 16:49:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:49:09,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:09,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299075946] [2022-11-21 16:49:09,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299075946] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:49:09,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737532621] [2022-11-21 16:49:09,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:49:09,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:49:09,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:49:09,010 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:49:09,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 16:49:09,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:49:09,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:49:09,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 16:49:09,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:49:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:49:09,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:49:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:49:10,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737532621] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:49:10,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:49:10,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-21 16:49:10,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583408859] [2022-11-21 16:49:10,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:49:10,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 16:49:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:10,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 16:49:10,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:49:10,527 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:11,617 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-11-21 16:49:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:49:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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 36 [2022-11-21 16:49:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:11,619 INFO L225 Difference]: With dead ends: 102 [2022-11-21 16:49:11,619 INFO L226 Difference]: Without dead ends: 62 [2022-11-21 16:49:11,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-21 16:49:11,622 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 110 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:11,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 34 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:49:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-21 16:49:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-11-21 16:49:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-11-21 16:49:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-21 16:49:11,643 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-11-21 16:49:11,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:11,644 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-21 16:49:11,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-21 16:49:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 16:49:11,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:11,651 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:11,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 16:49:11,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:49:11,851 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:49:11,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2022-11-21 16:49:11,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:11,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098088104] [2022-11-21 16:49:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:49:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:12,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098088104] [2022-11-21 16:49:12,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098088104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:49:12,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414256138] [2022-11-21 16:49:12,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:49:12,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:49:12,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:49:12,630 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:49:12,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 16:49:12,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-21 16:49:12,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:49:12,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 16:49:12,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:49:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:49:13,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:49:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:49:14,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414256138] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:49:14,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:49:14,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-21 16:49:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345293359] [2022-11-21 16:49:14,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:49:14,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 16:49:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 16:49:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:49:14,099 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:15,674 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-11-21 16:49:15,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 16:49:15,675 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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 36 [2022-11-21 16:49:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:15,675 INFO L225 Difference]: With dead ends: 57 [2022-11-21 16:49:15,675 INFO L226 Difference]: Without dead ends: 45 [2022-11-21 16:49:15,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-21 16:49:15,677 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:15,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 30 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 16:49:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-21 16:49:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-11-21 16:49:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 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-11-21 16:49:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-11-21 16:49:15,693 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2022-11-21 16:49:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:15,694 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-11-21 16:49:15,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-11-21 16:49:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 16:49:15,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:15,696 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:15,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 16:49:15,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 16:49:15,903 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:49:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:15,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-11-21 16:49:15,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:15,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551079539] [2022-11-21 16:49:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:15,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:49:26,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:26,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551079539] [2022-11-21 16:49:26,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551079539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:49:26,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886554600] [2022-11-21 16:49:26,987 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:49:26,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:49:26,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:49:26,989 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:49:26,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14343e9e-1a86-4846-adaf-8dc05bbaa004/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 16:49:27,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:49:27,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:49:27,140 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-21 16:49:27,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:49:27,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:49:27,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-21 16:49:28,076 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 14 treesize of output 16 [2022-11-21 16:49:28,613 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 14 treesize of output 16 [2022-11-21 16:49:29,074 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 14 treesize of output 16 [2022-11-21 16:49:29,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 16:49:31,754 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-21 16:49:33,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:33,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:49:33,249 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:49:33,250 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2022-11-21 16:49:34,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:34,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:34,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:34,924 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:49:34,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 49 [2022-11-21 16:49:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:36,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:36,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:36,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:36,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:36,666 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:49:36,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 61 [2022-11-21 16:49:39,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:49:39,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:39,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:39,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:39,149 INFO L321 Elim1Store]: treesize reduction 59, result has 24.4 percent of original size [2022-11-21 16:49:39,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 67 treesize of output 70 [2022-11-21 16:49:40,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:40,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:40,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:40,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:40,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:49:40,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:40,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:40,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-11-21 16:49:41,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:41,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:41,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:41,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:41,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:41,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:41,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:49:41,702 INFO L321 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2022-11-21 16:49:41,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 67 treesize of output 70 [2022-11-21 16:49:43,001 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-11-21 16:49:43,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 63 treesize of output 55 [2022-11-21 16:49:43,744 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:49:43,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 42 [2022-11-21 16:49:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:49:44,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:50:18,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:50:18,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1159 treesize of output 287 [2022-11-21 16:50:32,305 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:50:32,305 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 386 treesize of output 1 [2022-11-21 16:50:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:32,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886554600] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:50:32,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:50:32,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 32] total 92 [2022-11-21 16:50:32,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173484509] [2022-11-21 16:50:32,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:50:32,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-11-21 16:50:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:32,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-11-21 16:50:32,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=6938, Unknown=0, NotChecked=0, Total=8372 [2022-11-21 16:50:32,315 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 92 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 92 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:04,931 WARN L233 SmtUtils]: Spent 22.52s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:52:08,664 WARN L233 SmtUtils]: Spent 37.39s on a formula simplification. DAG size of input: 241 DAG size of output: 166 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:52:57,667 WARN L233 SmtUtils]: Spent 37.99s on a formula simplification. DAG size of input: 127 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:53:00,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse98 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse99 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse96 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse72 (select .cse28 .cse96)) (.cse83 (select .cse28 .cse99)) (.cse73 (+ .cse98 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (select .cse28 .cse73)) (.cse43 (store .cse28 .cse99 (+ .cse83 1))) (.cse97 (+ .cse72 1)) (.cse56 (+ .cse98 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse75 (select .cse28 .cse56)) (.cse95 (store .cse43 .cse96 .cse97)) (.cse74 (+ .cse64 1))) (let ((.cse2 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse15 (store .cse28 .cse96 .cse97)) (.cse20 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse71 (store .cse95 .cse73 .cse74)) (.cse57 (+ .cse75 1)) (.cse44 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse5 (* c_~N~0 2)) (.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (= .cse5 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse95))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse90 (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse94 (select .cse95 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse89 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse90 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse89 .cse90 .cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse94)))))))) (.cse46 (<= (mod c_~N~0 4294967296) 536870911)) (.cse3 (not .cse44)) (.cse16 (< 4 c_~N~0)) (.cse17 (not (< 3 c_~N~0))) (.cse19 (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse13) 2)) (not (= 2 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (select v_arrayElimArr_5 .cse14) 2)) (not (= 2 (select v_arrayElimArr_5 .cse12))) (= .cse5 (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse88 (select .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse84 2 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) 2 .cse87 .cse88)))))))))) (.cse45 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse1 (not (= .cse83 1))) (.cse31 (= .cse5 (let ((.cse82 (store .cse71 .cse56 .cse57))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse82))) (let ((.cse77 (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse80 (select .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse81 (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse79 (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse80 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse79 .cse80 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse78 .cse79 .cse80 .cse81))))))))) (.cse34 (not .cse20)) (.cse35 (not (= .cse75 1))) (.cse36 (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0)) (.cse55 (store .cse15 .cse73 .cse74)) (.cse0 (not (= .cse72 1))) (.cse47 (= .cse5 (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse71))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse65 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse69 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse70 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse65 .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse66 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse69 .cse70)))))))) (.cse32 (not (= .cse64 1))) (.cse18 (not .cse2)) (.cse33 (not (= |c_ULTIMATE.start_main_#t~mem8#1| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse2 .cse3 (= .cse5 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse9 .cse10 .cse11)))))))) (or .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse21 (select .cse28 .cse13)) (.cse29 (select .cse28 .cse14)) (.cse26 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (select .cse28 .cse12))) (or (not (= .cse21 1)) (= .cse5 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse26 1)) .cse14 (+ .cse29 1)) .cse13 (+ .cse21 1)) .cse12 (+ .cse30 1))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 1 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse25 .cse26 1 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse25 .cse26 1 .cse27))))))) (not (= .cse29 1)) .cse16 .cse17 (not (= .cse26 1)) (not (= .cse30 1)))) (or .cse0 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse0 .cse2 .cse33 .cse3 .cse4) (or .cse16 .cse17 .cse19 .cse34 .cse36) (or .cse1 (= (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse41 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse42 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse39 .cse40 .cse41 .cse42)))))) .cse5) .cse44 .cse45) .cse46 (or .cse0 .cse1 .cse47 .cse32 .cse18 .cse20) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse46) (and (not .cse46) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or .cse0 (= .cse5 (let ((.cse54 (store .cse55 .cse56 .cse57))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse49 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse53 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse52 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse48 .cse49 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse52 .cse53)))))))) .cse32 .cse34 .cse35 .cse36) (or .cse16 .cse2 .cse17 .cse19 .cse3) (or .cse44 .cse16 .cse17 .cse19 .cse45) (or .cse0 .cse1 .cse31 .cse32 .cse34 .cse35 .cse36) (or .cse0 (= (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse60 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse59 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse58 .cse59 .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse63)))))) .cse5) .cse32 .cse18 .cse20) (or .cse0 .cse47 .cse32 .cse18 .cse33 .cse20))))))))) is different from false [2022-11-21 16:53:02,718 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse98 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse99 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse96 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse72 (select .cse28 .cse96)) (.cse83 (select .cse28 .cse99)) (.cse73 (+ .cse98 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (select .cse28 .cse73)) (.cse43 (store .cse28 .cse99 (+ .cse83 1))) (.cse97 (+ .cse72 1)) (.cse56 (+ .cse98 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse75 (select .cse28 .cse56)) (.cse95 (store .cse43 .cse96 .cse97)) (.cse74 (+ .cse64 1))) (let ((.cse2 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse15 (store .cse28 .cse96 .cse97)) (.cse20 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse71 (store .cse95 .cse73 .cse74)) (.cse57 (+ .cse75 1)) (.cse44 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse5 (* c_~N~0 2)) (.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (= .cse5 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse95))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse90 (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse94 (select .cse95 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse89 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse90 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse89 .cse90 .cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse94)))))))) (.cse46 (<= (mod c_~N~0 4294967296) 536870911)) (.cse3 (not .cse44)) (.cse16 (< 4 c_~N~0)) (.cse17 (not (< 3 c_~N~0))) (.cse19 (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse13) 2)) (not (= 2 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (select v_arrayElimArr_5 .cse14) 2)) (not (= 2 (select v_arrayElimArr_5 .cse12))) (= .cse5 (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse88 (select .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse87 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse84 2 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) 2 .cse87 .cse88)))))))))) (.cse45 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse1 (not (= .cse83 1))) (.cse31 (= .cse5 (let ((.cse82 (store .cse71 .cse56 .cse57))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse82))) (let ((.cse77 (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse80 (select .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse81 (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse79 (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse80 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse79 .cse80 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse78 .cse79 .cse80 .cse81))))))))) (.cse34 (not .cse20)) (.cse35 (not (= .cse75 1))) (.cse36 (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0)) (.cse55 (store .cse15 .cse73 .cse74)) (.cse0 (not (= .cse72 1))) (.cse47 (= .cse5 (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse71))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse65 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse69 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse70 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse65 .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse66 .cse69 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse69 .cse70)))))))) (.cse32 (not (= .cse64 1))) (.cse18 (not .cse2)) (.cse33 (not (= |c_ULTIMATE.start_main_#t~mem8#1| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse2 .cse3 (= .cse5 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse9 .cse10 .cse11)))))))) (or .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse21 (select .cse28 .cse13)) (.cse29 (select .cse28 .cse14)) (.cse26 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (select .cse28 .cse12))) (or (not (= .cse21 1)) (= .cse5 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse26 1)) .cse14 (+ .cse29 1)) .cse13 (+ .cse21 1)) .cse12 (+ .cse30 1))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 1 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse25 .cse26 1 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse25 .cse26 1 .cse27))))))) (not (= .cse29 1)) .cse16 .cse17 (not (= .cse26 1)) (not (= .cse30 1)))) (or .cse0 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse0 .cse2 .cse33 .cse3 .cse4) (or .cse16 .cse17 .cse19 .cse34 .cse36) (or .cse1 (= (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse41 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse42 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse39 .cse40 .cse41 .cse42)))))) .cse5) .cse44 .cse45) .cse46 (or .cse0 .cse1 .cse47 .cse32 .cse18 .cse20) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse46) (and (not .cse46) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or .cse0 (= .cse5 (let ((.cse54 (store .cse55 .cse56 .cse57))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse49 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse53 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse52 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse48 .cse49 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse52 .cse53)))))))) .cse32 .cse34 .cse35 .cse36) (or .cse16 .cse2 .cse17 .cse19 .cse3) (or .cse44 .cse16 .cse17 .cse19 .cse45) (or .cse0 .cse1 .cse31 .cse32 .cse34 .cse35 .cse36) (or .cse0 (= (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse60 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse59 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse58 .cse59 .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse63)))))) .cse5) .cse32 .cse18 .cse20) (or .cse0 .cse47 .cse32 .cse18 .cse33 .cse20))))))))) is different from true [2022-11-21 16:53:04,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:53:06,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:54:10,451 WARN L233 SmtUtils]: Spent 51.00s on a formula simplification. DAG size of input: 145 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:54:13,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:54:15,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:54:57,075 WARN L233 SmtUtils]: Spent 34.21s on a formula simplification. DAG size of input: 123 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:55:49,768 WARN L233 SmtUtils]: Spent 28.32s on a formula simplification. DAG size of input: 140 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:55:51,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:55:54,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:56:48,509 WARN L233 SmtUtils]: Spent 41.84s on a formula simplification. DAG size of input: 141 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:57:16,105 WARN L233 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:57:18,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:57:45,917 WARN L233 SmtUtils]: Spent 21.05s on a formula simplification. DAG size of input: 119 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:58:24,343 WARN L233 SmtUtils]: Spent 22.50s on a formula simplification. DAG size of input: 137 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:59:01,340 WARN L233 SmtUtils]: Spent 20.59s on a formula simplification. DAG size of input: 134 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:59:03,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:59:20,810 WARN L233 SmtUtils]: Spent 10.97s on a formula simplification. DAG size of input: 115 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:59:39,481 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:59:51,031 WARN L233 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 98 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:00:40,492 WARN L233 SmtUtils]: Spent 21.01s on a formula simplification. DAG size of input: 128 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:01:16,231 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse89 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse90 (+ .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse86 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse87 (+ .cse89 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse62 (select .cse86 .cse87)) (.cse73 (select .cse86 .cse90)) (.cse63 (+ .cse89 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse54 (select .cse86 .cse63)) (.cse33 (store .cse86 .cse90 (+ .cse73 1))) (.cse88 (+ .cse62 1)) (.cse46 (+ .cse89 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (select .cse86 .cse46)) (.cse85 (store .cse33 .cse87 .cse88)) (.cse64 (+ .cse54 1))) (let ((.cse2 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse15 (store .cse86 .cse87 .cse88)) (.cse20 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse61 (store .cse85 .cse63 .cse64)) (.cse47 (+ .cse65 1)) (.cse34 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse5 (* c_~N~0 2)) (.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (= .cse5 (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse85))) (let ((.cse83 (select .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse80 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse84 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse79 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse81 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse79 .cse80 .cse81 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse81 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse84)))))))) (.cse36 (<= (mod c_~N~0 4294967296) 536870911)) (.cse3 (not .cse34)) (.cse16 (< 4 c_~N~0)) (.cse17 (not (< 3 c_~N~0))) (.cse19 (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse13) 2)) (not (= 2 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (select v_arrayElimArr_5 .cse14) 2)) (not (= 2 (select v_arrayElimArr_5 .cse12))) (= .cse5 (let ((.cse75 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse76 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse74 (select (select (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse74 (select (select (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 2 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) 2 .cse77 .cse78)))))))))) (.cse35 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse1 (not (= .cse73 1))) (.cse21 (= .cse5 (let ((.cse72 (store .cse61 .cse46 .cse47))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse72))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse70 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse71 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse69 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse70 .cse71))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse69 .cse70 .cse71))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse68 .cse69 .cse70 .cse71))))))))) (.cse24 (not .cse20)) (.cse25 (not (= .cse65 1))) (.cse26 (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0)) (.cse45 (store .cse15 .cse63 .cse64)) (.cse0 (not (= .cse62 1))) (.cse37 (= .cse5 (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse61))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse59 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse60 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse59 .cse60))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse55 .cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse59 .cse60))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse59 .cse60)))))))) (.cse22 (not (= .cse54 1))) (.cse18 (not .cse2)) (.cse23 (not (= |c_ULTIMATE.start_main_#t~mem8#1| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse2 .cse3 (= .cse5 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse9 .cse10 .cse11)))))))) (or .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse23 .cse3 .cse4) (or .cse16 .cse17 .cse19 .cse24 .cse26) (or .cse1 (= (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse31 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse32 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse29 .cse30 .cse31 .cse32)))))) .cse5) .cse34 .cse35) .cse36 (or .cse0 .cse1 .cse37 .cse22 .cse18 .cse20) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse36) (and (not .cse36) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or .cse0 (= .cse5 (let ((.cse44 (store .cse45 .cse46 .cse47))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse44))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse38 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse42 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse38 .cse39 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39 .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse42 .cse43)))))))) .cse22 .cse24 .cse25 .cse26) (or .cse16 .cse2 .cse17 .cse19 .cse3) (or .cse34 .cse16 .cse17 .cse19 .cse35) (or .cse0 .cse1 .cse21 .cse22 .cse24 .cse25 .cse26) (or .cse0 (= (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse48 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (+ .cse48 .cse49 .cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) .cse53)))))) .cse5) .cse22 .cse18 .cse20) (or .cse0 .cse37 .cse22 .cse18 .cse23 .cse20))))))))) is different from true