./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s4if.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:41:20,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:41:20,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:41:20,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:41:20,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:41:20,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:41:20,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:41:20,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:41:20,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:41:20,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:41:20,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:41:20,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:41:20,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:41:20,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:41:20,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:41:20,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:41:20,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:41:20,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:41:20,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:41:20,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:41:20,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:41:20,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:41:20,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:41:20,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:41:20,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:41:20,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:41:20,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:41:20,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:41:20,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:41:20,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:41:20,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:41:20,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:41:20,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:41:20,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:41:20,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:41:20,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:41:20,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:41:20,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:41:20,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:41:20,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:41:20,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:41:20,147 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:41:20,185 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:41:20,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:41:20,186 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:41:20,186 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:41:20,187 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:41:20,187 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:41:20,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:41:20,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:41:20,188 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:41:20,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:41:20,190 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:41:20,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:41:20,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:41:20,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:41:20,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:41:20,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:41:20,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:41:20,191 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:41:20,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:41:20,191 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:41:20,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:41:20,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:41:20,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:41:20,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:41:20,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:41:20,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:41:20,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:41:20,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:41:20,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:41:20,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:41:20,194 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:41:20,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:41:20,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:41:20,195 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_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2022-11-20 11:41:20,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:41:20,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:41:20,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:41:20,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:41:20,540 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:41:20,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/array-fpi/s4if.c [2022-11-20 11:41:23,525 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:41:23,727 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:41:23,728 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/sv-benchmarks/c/array-fpi/s4if.c [2022-11-20 11:41:23,735 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/data/ffa7a22c4/15953a157ebb4ff08f46af55198374ec/FLAG07cc5bff6 [2022-11-20 11:41:23,752 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/data/ffa7a22c4/15953a157ebb4ff08f46af55198374ec [2022-11-20 11:41:23,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:41:23,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:41:23,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:41:23,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:41:23,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:41:23,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:41:23" (1/1) ... [2022-11-20 11:41:23,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc5d42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:23, skipping insertion in model container [2022-11-20 11:41:23,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:41:23" (1/1) ... [2022-11-20 11:41:23,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:41:23,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:41:24,009 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_56231d8a-f94f-4185-97af-91bdb2c7e08c/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2022-11-20 11:41:24,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:41:24,049 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:41:24,065 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_56231d8a-f94f-4185-97af-91bdb2c7e08c/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2022-11-20 11:41:24,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:41:24,089 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:41:24,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24 WrapperNode [2022-11-20 11:41:24,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:41:24,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:41:24,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:41:24,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:41:24,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,184 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-11-20 11:41:24,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:41:24,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:41:24,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:41:24,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:41:24,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,234 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:41:24,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:41:24,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:41:24,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:41:24,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (1/1) ... [2022-11-20 11:41:24,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:41:24,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:24,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:41:24,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:41:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:41:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:41:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:41:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:41:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:41:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:41:24,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:41:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:41:24,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:41:24,446 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:41:24,448 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:41:24,658 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:41:24,664 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:41:24,664 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 11:41:24,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:41:24 BoogieIcfgContainer [2022-11-20 11:41:24,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:41:24,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:41:24,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:41:24,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:41:24,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:41:23" (1/3) ... [2022-11-20 11:41:24,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2c0e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:41:24, skipping insertion in model container [2022-11-20 11:41:24,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:24" (2/3) ... [2022-11-20 11:41:24,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2c0e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:41:24, skipping insertion in model container [2022-11-20 11:41:24,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:41:24" (3/3) ... [2022-11-20 11:41:24,677 INFO L112 eAbstractionObserver]: Analyzing ICFG s4if.c [2022-11-20 11:41:24,699 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:41:24,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:41:24,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:41:24,764 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;@3758d411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:41:24,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:41:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:41:24,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:24,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:24,778 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:24,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-11-20 11:41:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:24,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919852529] [2022-11-20 11:41:24,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:24,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:24,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919852529] [2022-11-20 11:41:24,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919852529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:41:24,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:41:24,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:41:24,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841754127] [2022-11-20 11:41:24,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:41:24,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:41:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:24,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:41:24,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:41:25,000 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:25,016 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-11-20 11:41:25,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:41:25,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-11-20 11:41:25,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:25,026 INFO L225 Difference]: With dead ends: 34 [2022-11-20 11:41:25,026 INFO L226 Difference]: Without dead ends: 15 [2022-11-20 11:41:25,029 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-20 11:41:25,033 INFO L413 NwaCegarLoop]: 22 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, 22 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-20 11:41:25,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:41:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-20 11:41:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-20 11:41:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-11-20 11:41:25,073 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-11-20 11:41:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:25,074 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-20 11:41:25,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-11-20 11:41:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:41:25,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:25,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:25,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:41:25,077 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-11-20 11:41:25,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:25,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430218644] [2022-11-20 11:41:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:25,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:25,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430218644] [2022-11-20 11:41:25,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430218644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:41:25,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:41:25,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:41:25,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722164122] [2022-11-20 11:41:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:41:25,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:41:25,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:25,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:41:25,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:41:25,301 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:25,399 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-20 11:41:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:41:25,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-11-20 11:41:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:25,401 INFO L225 Difference]: With dead ends: 28 [2022-11-20 11:41:25,401 INFO L226 Difference]: Without dead ends: 20 [2022-11-20 11:41:25,401 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-20 11:41:25,403 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:25,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:41:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-20 11:41:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-11-20 11:41:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-20 11:41:25,409 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-11-20 11:41:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:25,410 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-20 11:41:25,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-20 11:41:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:41:25,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:25,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:25,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:41:25,412 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:25,413 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-11-20 11:41:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:25,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026832650] [2022-11-20 11:41:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:25,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:26,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:26,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026832650] [2022-11-20 11:41:26,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026832650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:41:26,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398006462] [2022-11-20 11:41:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:26,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:26,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:26,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:41:26,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:41:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:26,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 11:41:26,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:26,568 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-20 11:41:26,590 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-20 11:41:26,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:41:26,789 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-20 11:41:26,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-20 11:41:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:26,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:27,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:41:27,445 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 79 treesize of output 72 [2022-11-20 11:41:27,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:41:27,464 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 66 treesize of output 54 [2022-11-20 11:41:27,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 11:41:27,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 11:41:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:27,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398006462] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:27,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:41:27,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-11-20 11:41:27,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590119812] [2022-11-20 11:41:27,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:27,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 11:41:27,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:27,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 11:41:27,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=269, Unknown=2, NotChecked=0, Total=342 [2022-11-20 11:41:27,493 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:27,686 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-11-20 11:41:27,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:41:27,687 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 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 16 [2022-11-20 11:41:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:27,690 INFO L225 Difference]: With dead ends: 36 [2022-11-20 11:41:27,690 INFO L226 Difference]: Without dead ends: 32 [2022-11-20 11:41:27,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=346, Unknown=2, NotChecked=0, Total=462 [2022-11-20 11:41:27,695 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:27,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 49 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-11-20 11:41:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-20 11:41:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2022-11-20 11:41:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 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-20 11:41:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-20 11:41:27,708 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2022-11-20 11:41:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:27,709 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-20 11:41:27,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-20 11:41:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:41:27,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:27,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:27,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:41:27,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:27,918 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2022-11-20 11:41:27,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:27,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564301097] [2022-11-20 11:41:27,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:27,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:27,949 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:41:27,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508681593] [2022-11-20 11:41:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:27,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:27,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:41:27,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:41:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:28,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:41:28,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:28,043 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-20 11:41:28,083 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-20 11:41:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:28,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:28,128 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-20 11:41:28,131 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-20 11:41:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:28,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:28,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564301097] [2022-11-20 11:41:28,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:41:28,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508681593] [2022-11-20 11:41:28,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508681593] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:28,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:41:28,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-20 11:41:28,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389321493] [2022-11-20 11:41:28,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:28,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:41:28,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:41:28,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:41:28,152 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:28,246 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-20 11:41:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:41:28,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 16 [2022-11-20 11:41:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:28,248 INFO L225 Difference]: With dead ends: 38 [2022-11-20 11:41:28,248 INFO L226 Difference]: Without dead ends: 26 [2022-11-20 11:41:28,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:41:28,252 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:28,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:41:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-20 11:41:28,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-11-20 11:41:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-20 11:41:28,266 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-11-20 11:41:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:28,271 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-20 11:41:28,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-20 11:41:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 11:41:28,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:28,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:28,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:41:28,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:28,481 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:28,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2022-11-20 11:41:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:28,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40935615] [2022-11-20 11:41:28,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:28,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:28,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40935615] [2022-11-20 11:41:28,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40935615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:41:28,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621916984] [2022-11-20 11:41:28,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:41:28,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:28,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:28,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:41:28,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:41:28,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:41:28,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:41:28,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:41:28,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:28,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:28,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621916984] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:28,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:41:28,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 11:41:28,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277363834] [2022-11-20 11:41:28,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:28,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:41:28,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:28,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:41:28,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:41:28,781 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-20 11:41:28,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:28,919 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-11-20 11:41:28,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:41:28,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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 18 [2022-11-20 11:41:28,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:28,921 INFO L225 Difference]: With dead ends: 33 [2022-11-20 11:41:28,921 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 11:41:28,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 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-20 11:41:28,922 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:28,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 25 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:41:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 11:41:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-11-20 11:41:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-11-20 11:41:28,928 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-11-20 11:41:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:28,928 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-11-20 11:41:28,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-20 11:41:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-11-20 11:41:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 11:41:28,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:28,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:28,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:41:29,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:29,138 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:29,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2022-11-20 11:41:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:29,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096149221] [2022-11-20 11:41:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:29,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:29,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096149221] [2022-11-20 11:41:29,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096149221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:41:29,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907294069] [2022-11-20 11:41:29,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:41:29,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:29,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:29,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:41:29,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:41:29,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 11:41:29,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:41:29,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:41:29,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:29,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:29,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907294069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:29,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:41:29,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 11:41:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442040739] [2022-11-20 11:41:29,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:29,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:41:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:29,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:41:29,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:41:29,452 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-20 11:41:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:29,545 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-11-20 11:41:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:41:29,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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) Word has length 19 [2022-11-20 11:41:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:29,547 INFO L225 Difference]: With dead ends: 37 [2022-11-20 11:41:29,547 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 11:41:29,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 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-20 11:41:29,548 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:29,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:41:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 11:41:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-11-20 11:41:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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-20 11:41:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-11-20 11:41:29,555 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-11-20 11:41:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:29,555 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-11-20 11:41:29,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-20 11:41:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-11-20 11:41:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:41:29,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:29,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:29,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:41:29,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 11:41:29,762 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:29,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2022-11-20 11:41:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:29,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669386244] [2022-11-20 11:41:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:30,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:30,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669386244] [2022-11-20 11:41:30,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669386244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:41:30,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801618998] [2022-11-20 11:41:30,401 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:41:30,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:30,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:30,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:41:30,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:41:30,489 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:41:30,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:41:30,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-20 11:41:30,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:30,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:41:30,513 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-20 11:41:30,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:41:30,602 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-20 11:41:30,763 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-20 11:41:30,973 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:41:30,974 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 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-20 11:41:31,154 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:41:31,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2022-11-20 11:41:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:31,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:34,788 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)))) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_42| 4))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (or (< (+ .cse0 .cse1 .cse2) (+ 5 .cse3)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse2 4)) (not (= .cse0 4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 3) (+ .cse6 .cse7 .cse8)) (not (= .cse8 4)) (not (= .cse6 4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|))))))))) is different from false [2022-11-20 11:41:34,893 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)))) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_42| 4))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (or (< (+ .cse0 .cse1 .cse2) (+ 5 .cse3)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse2 4)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= .cse0 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (< (+ 7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (+ .cse7 .cse8 .cse9)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse9 4)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= .cse7 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))))) is different from false [2022-11-20 11:41:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 11:41:35,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801618998] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:35,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:41:35,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2022-11-20 11:41:35,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353461065] [2022-11-20 11:41:35,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:35,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 11:41:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:35,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 11:41:35,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=934, Unknown=3, NotChecked=126, Total=1190 [2022-11-20 11:41:35,049 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 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-20 11:41:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:35,951 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-11-20 11:41:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:41:35,951 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 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 21 [2022-11-20 11:41:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:35,953 INFO L225 Difference]: With dead ends: 43 [2022-11-20 11:41:35,953 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 11:41:35,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=229, Invalid=1582, Unknown=3, NotChecked=166, Total=1980 [2022-11-20 11:41:35,956 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:35,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 155 Invalid, 0 Unknown, 172 Unchecked, 0.1s Time] [2022-11-20 11:41:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 11:41:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-11-20 11:41:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 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-20 11:41:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-20 11:41:35,978 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 21 [2022-11-20 11:41:35,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:35,978 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-20 11:41:35,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 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-20 11:41:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-20 11:41:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:41:35,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:35,980 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:35,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:41:36,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:36,186 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:36,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:36,187 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2022-11-20 11:41:36,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:36,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340032104] [2022-11-20 11:41:36,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:36,206 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:41:36,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533929052] [2022-11-20 11:41:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:36,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:36,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:36,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:41:36,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:41:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:36,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 11:41:36,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:36,331 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-20 11:41:36,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:36,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:41:36,433 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-20 11:41:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:36,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:36,515 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-11-20 11:41:36,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:41:36,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-20 11:41:36,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:41:36,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-11-20 11:41:36,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:41:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 11:41:36,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:36,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340032104] [2022-11-20 11:41:36,591 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:41:36,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533929052] [2022-11-20 11:41:36,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533929052] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:36,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:41:36,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-20 11:41:36,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402158842] [2022-11-20 11:41:36,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:36,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:41:36,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:36,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:41:36,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=145, Unknown=3, NotChecked=24, Total=210 [2022-11-20 11:41:36,594 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-20 11:41:36,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:36,778 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-11-20 11:41:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:41:36,779 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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 21 [2022-11-20 11:41:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:36,780 INFO L225 Difference]: With dead ends: 44 [2022-11-20 11:41:36,780 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 11:41:36,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=242, Unknown=3, NotChecked=32, Total=342 [2022-11-20 11:41:36,781 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:36,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 50 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 85 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-11-20 11:41:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 11:41:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-11-20 11:41:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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-20 11:41:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-11-20 11:41:36,789 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 21 [2022-11-20 11:41:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:36,789 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-11-20 11:41:36,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-20 11:41:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-11-20 11:41:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:41:36,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:36,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:36,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:41:36,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:36,999 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2022-11-20 11:41:37,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:37,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16165590] [2022-11-20 11:41:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:37,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:37,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16165590] [2022-11-20 11:41:37,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16165590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:41:37,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766339966] [2022-11-20 11:41:37,112 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:41:37,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:37,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:37,113 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:41:37,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:41:37,194 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-20 11:41:37,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:41:37,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:41:37,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:37,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:37,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766339966] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:37,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:41:37,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-20 11:41:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62687359] [2022-11-20 11:41:37,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:37,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:41:37,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:37,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:41:37,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:41:37,350 INFO L87 Difference]: Start difference. First operand 36 states and 40 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-20 11:41:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:37,555 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-11-20 11:41:37,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:41:37,556 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 23 [2022-11-20 11:41:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:37,556 INFO L225 Difference]: With dead ends: 44 [2022-11-20 11:41:37,557 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 11:41:37,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:41:37,558 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:37,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 27 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:41:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 11:41:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-11-20 11:41:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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-20 11:41:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-11-20 11:41:37,566 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 23 [2022-11-20 11:41:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:37,566 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-11-20 11:41:37,566 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-20 11:41:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-11-20 11:41:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:41:37,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:37,567 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:37,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:41:37,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:37,770 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash -981578845, now seen corresponding path program 2 times [2022-11-20 11:41:37,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:37,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978514814] [2022-11-20 11:41:37,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:37,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:41:37,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363956756] [2022-11-20 11:41:37,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:41:37,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:37,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:37,787 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:41:37,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:41:37,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:41:37,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:41:37,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:41:37,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:37,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:38,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:38,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978514814] [2022-11-20 11:41:38,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:41:38,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363956756] [2022-11-20 11:41:38,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363956756] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:38,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:41:38,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-20 11:41:38,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581526109] [2022-11-20 11:41:38,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:38,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:41:38,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:38,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:41:38,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:41:38,057 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-20 11:41:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:38,198 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-20 11:41:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:41:38,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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 24 [2022-11-20 11:41:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:38,203 INFO L225 Difference]: With dead ends: 48 [2022-11-20 11:41:38,204 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 11:41:38,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:41:38,205 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:38,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:41:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 11:41:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-11-20 11:41:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-11-20 11:41:38,211 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-11-20 11:41:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:38,211 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-11-20 11:41:38,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-20 11:41:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-11-20 11:41:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:41:38,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:38,213 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:38,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:41:38,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:41:38,418 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:38,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 6 times [2022-11-20 11:41:38,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:38,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954325963] [2022-11-20 11:41:38,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:38,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:39,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:39,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954325963] [2022-11-20 11:41:39,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954325963] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:41:39,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000443801] [2022-11-20 11:41:39,316 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:41:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:39,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:39,317 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:41:39,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:41:39,421 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-20 11:41:39,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:41:39,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-20 11:41:39,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:39,436 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-20 11:41:39,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:39,470 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-20 11:41:39,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:39,511 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-20 11:41:39,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:39,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:41:39,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:39,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-20 11:41:39,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:39,980 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:41:39,980 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 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-20 11:41:40,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:40,292 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-20 11:41:40,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 55 [2022-11-20 11:41:40,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:40,535 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-20 11:41:40,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 33 [2022-11-20 11:41:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:41:40,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:46,734 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse4)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ .cse1 .cse2 .cse3 .cse0) (+ 5 .cse4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 3) (+ .cse8 .cse9 .cse10 .cse7)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))))))))) is different from false [2022-11-20 11:41:46,931 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ 7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (+ .cse1 .cse2 .cse3 .cse0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse11)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ .cse8 .cse9 .cse10 .cse7) (+ 5 .cse11)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))))) is different from false [2022-11-20 11:41:47,261 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 11) (+ .cse1 .cse2 .cse3 .cse0)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse11)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ .cse8 .cse9 .cse10 .cse7) (+ 5 .cse11)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))))) is different from false [2022-11-20 11:41:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-20 11:41:47,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000443801] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:47,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:41:47,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 47 [2022-11-20 11:41:47,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306473861] [2022-11-20 11:41:47,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:47,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-20 11:41:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:41:47,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-20 11:41:47,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1721, Unknown=4, NotChecked=258, Total=2162 [2022-11-20 11:41:47,529 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:58,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:58,414 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-11-20 11:41:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 11:41:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 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 26 [2022-11-20 11:41:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:58,415 INFO L225 Difference]: With dead ends: 55 [2022-11-20 11:41:58,415 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 11:41:58,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=381, Invalid=3533, Unknown=4, NotChecked=372, Total=4290 [2022-11-20 11:41:58,418 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:58,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 104 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 206 Invalid, 0 Unknown, 417 Unchecked, 0.2s Time] [2022-11-20 11:41:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 11:41:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-20 11:41:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 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-20 11:41:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-11-20 11:41:58,427 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 26 [2022-11-20 11:41:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:58,428 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-11-20 11:41:58,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:41:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-11-20 11:41:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:41:58,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:58,429 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:58,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-20 11:41:58,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 11:41:58,635 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:58,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 3 times [2022-11-20 11:41:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:41:58,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897750271] [2022-11-20 11:41:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:41:58,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:41:58,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1424192413] [2022-11-20 11:41:58,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:41:58,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:58,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:58,666 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:41:58,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:41:58,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 11:41:58,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:41:58,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 11:41:58,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:58,793 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-20 11:41:58,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:58,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 11:41:58,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:58,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 11:41:59,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:41:59,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-20 11:41:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:41:59,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:42:00,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:42:00,870 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 26 treesize of output 27 [2022-11-20 11:42:00,882 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 11:42:00,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-11-20 11:42:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:42:02,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:42:02,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897750271] [2022-11-20 11:42:02,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:42:02,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424192413] [2022-11-20 11:42:02,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424192413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:42:02,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:42:02,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-11-20 11:42:02,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761574108] [2022-11-20 11:42:02,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:42:02,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:42:02,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:42:02,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:42:02,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=175, Unknown=3, NotChecked=0, Total=240 [2022-11-20 11:42:02,915 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-20 11:42:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:42:02,974 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-11-20 11:42:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:42:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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) Word has length 26 [2022-11-20 11:42:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:42:02,976 INFO L225 Difference]: With dead ends: 54 [2022-11-20 11:42:02,976 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 11:42:02,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=76, Invalid=193, Unknown=3, NotChecked=0, Total=272 [2022-11-20 11:42:02,977 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:42:02,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 37 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-11-20 11:42:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 11:42:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-11-20 11:42:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-11-20 11:42:02,988 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 26 [2022-11-20 11:42:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:42:02,989 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-11-20 11:42:02,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-20 11:42:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-11-20 11:42:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:42:02,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:42:02,990 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:42:02,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:42:03,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:42:03,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:42:03,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:42:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 7 times [2022-11-20 11:42:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:42:03,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229194799] [2022-11-20 11:42:03,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:42:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:42:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:42:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:03,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:42:03,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229194799] [2022-11-20 11:42:03,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229194799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:42:03,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763522750] [2022-11-20 11:42:03,346 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 11:42:03,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:42:03,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:42:03,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:42:03,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 11:42:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:42:03,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 11:42:03,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:42:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:03,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:42:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:03,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763522750] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:42:03,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:42:03,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-20 11:42:03,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471409797] [2022-11-20 11:42:03,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:42:03,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 11:42:03,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:42:03,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 11:42:03,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:42:03,672 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:03,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:42:03,925 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-11-20 11:42:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:42:03,925 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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 28 [2022-11-20 11:42:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:42:03,926 INFO L225 Difference]: With dead ends: 65 [2022-11-20 11:42:03,926 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 11:42:03,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-20 11:42:03,927 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 50 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:42:03,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 28 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:42:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 11:42:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-11-20 11:42:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-11-20 11:42:03,939 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 28 [2022-11-20 11:42:03,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:42:03,939 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-11-20 11:42:03,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-11-20 11:42:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:42:03,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:42:03,941 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:42:03,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 11:42:04,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 11:42:04,146 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:42:04,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:42:04,146 INFO L85 PathProgramCache]: Analyzing trace with hash -798779835, now seen corresponding path program 4 times [2022-11-20 11:42:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:42:04,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508993737] [2022-11-20 11:42:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:42:04,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:42:04,158 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:42:04,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023177294] [2022-11-20 11:42:04,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:42:04,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:42:04,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:42:04,160 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:42:04,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 11:42:04,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:42:04,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:42:04,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 11:42:04,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:42:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:04,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:42:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:04,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:42:04,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508993737] [2022-11-20 11:42:04,487 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:42:04,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023177294] [2022-11-20 11:42:04,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023177294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:42:04,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:42:04,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-11-20 11:42:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130903404] [2022-11-20 11:42:04,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:42:04,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:42:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:42:04,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:42:04,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:42:04,489 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 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-20 11:42:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:42:04,692 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-11-20 11:42:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:42:04,692 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 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 29 [2022-11-20 11:42:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:42:04,693 INFO L225 Difference]: With dead ends: 71 [2022-11-20 11:42:04,693 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 11:42:04,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:42:04,694 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 72 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:42:04,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 24 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:42:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 11:42:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-11-20 11:42:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-20 11:42:04,702 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2022-11-20 11:42:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:42:04,702 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-20 11:42:04,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 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-20 11:42:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-20 11:42:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 11:42:04,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:42:04,703 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:42:04,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 11:42:04,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 11:42:04,909 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:42:04,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:42:04,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 8 times [2022-11-20 11:42:04,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:42:04,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430917473] [2022-11-20 11:42:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:42:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:42:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:42:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:42:05,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430917473] [2022-11-20 11:42:05,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430917473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:42:05,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796428789] [2022-11-20 11:42:05,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:42:05,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:42:05,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:42:05,996 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:42:05,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 11:42:06,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:42:06,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:42:06,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-20 11:42:06,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:42:06,120 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-20 11:42:06,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:42:06,161 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-20 11:42:06,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:42:06,215 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-20 11:42:06,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:42:06,275 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-20 11:42:06,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:42:06,334 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-20 11:42:06,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:42:06,561 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-20 11:42:06,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:42:06,742 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:42:06,742 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 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-20 11:42:06,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:42:06,947 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:42:06,948 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 1 case distinctions, treesize of input 61 treesize of output 43 [2022-11-20 11:42:07,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:42:07,158 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:42:07,158 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 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-20 11:42:07,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:42:07,308 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:42:07,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2022-11-20 11:42:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:07,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:42:15,217 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_subst_6 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_144| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse1 .cse0 .cse3 .cse4) (+ 5 .cse5)) (not (= 4 .cse4)) (not (= .cse3 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_subst_5 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_145| 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= .cse8 4)) (< (+ .cse5 3) (+ .cse9 .cse10 .cse11 .cse12 .cse8)) (not (= .cse11 4)) (not (= .cse9 4)) (not (= .cse12 4)))))))))))) is different from false [2022-11-20 11:42:15,342 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_subst_5 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_145| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= .cse3 4)) (< (+ 7 .cse4) (+ .cse2 .cse5 .cse1 .cse3 .cse0)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_subst_6 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_144| 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse8 4)) (not (= .cse9 4)) (< (+ .cse10 .cse9 .cse8 .cse11 .cse12) (+ .cse4 9)) (not (= 4 .cse12)) (not (= .cse11 4)))))))))))) is different from false [2022-11-20 11:42:15,584 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_subst_6 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_144| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse1 .cse0 .cse3 .cse4) (+ .cse5 13)) (not (= 4 .cse4)) (not (= .cse3 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_subst_5 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_145| 4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= .cse8 4)) (not (= .cse9 4)) (not (= .cse10 4)) (not (= .cse11 4)) (< (+ .cse5 11) (+ .cse10 .cse12 .cse9 .cse11 .cse8)))))))))))) is different from false [2022-11-20 11:42:15,809 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_subst_6 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_144| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse1 .cse0 .cse3 .cse4) (+ .cse5 17)) (not (= 4 .cse4)) (not (= .cse3 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_subst_5 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_485))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_485 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_145| 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= .cse8 4)) (< (+ .cse5 15) (+ .cse9 .cse10 .cse11 .cse12 .cse8)) (not (= .cse11 4)) (not (= .cse9 4)) (not (= .cse12 4)))))))))))) is different from false [2022-11-20 11:42:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-20 11:42:15,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796428789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:42:15,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:42:15,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2022-11-20 11:42:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147368424] [2022-11-20 11:42:15,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:42:15,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 11:42:15,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:42:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 11:42:15,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2085, Unknown=5, NotChecked=380, Total=2652 [2022-11-20 11:42:15,945 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:42:16,948 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-11-20 11:42:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 11:42:16,949 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 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 31 [2022-11-20 11:42:16,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:42:16,950 INFO L225 Difference]: With dead ends: 58 [2022-11-20 11:42:16,950 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 11:42:16,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=212, Invalid=2249, Unknown=5, NotChecked=396, Total=2862 [2022-11-20 11:42:16,951 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 465 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:42:16,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 144 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 240 Invalid, 0 Unknown, 465 Unchecked, 0.2s Time] [2022-11-20 11:42:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 11:42:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-11-20 11:42:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-11-20 11:42:16,963 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 31 [2022-11-20 11:42:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:42:16,963 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-11-20 11:42:16,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-11-20 11:42:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 11:42:16,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:42:16,965 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:42:16,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-20 11:42:17,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:42:17,171 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:42:17,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:42:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1338916473, now seen corresponding path program 5 times [2022-11-20 11:42:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:42:17,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049902977] [2022-11-20 11:42:17,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:42:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:42:17,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:42:17,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380703847] [2022-11-20 11:42:17,190 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:42:17,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:42:17,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:42:17,191 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:42:17,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 11:42:17,320 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-20 11:42:17,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:42:17,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-20 11:42:17,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:42:17,333 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-20 11:42:17,399 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 15 treesize of output 11 [2022-11-20 11:42:17,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:42:17,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 11:42:17,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:42:17,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:42:17,620 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-20 11:42:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:42:17,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:42:17,763 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-11-20 11:42:17,952 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-20 11:42:17,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-20 11:42:17,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:42:17,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-11-20 11:42:17,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:42:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2022-11-20 11:42:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:42:18,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049902977] [2022-11-20 11:42:18,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:42:18,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380703847] [2022-11-20 11:42:18,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380703847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:42:18,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:42:18,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-11-20 11:42:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825105954] [2022-11-20 11:42:18,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:42:18,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 11:42:18,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:42:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 11:42:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=386, Unknown=10, NotChecked=40, Total=506 [2022-11-20 11:42:18,058 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:42:18,370 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-11-20 11:42:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:42:18,371 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 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 31 [2022-11-20 11:42:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:42:18,372 INFO L225 Difference]: With dead ends: 61 [2022-11-20 11:42:18,372 INFO L226 Difference]: Without dead ends: 52 [2022-11-20 11:42:18,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=592, Unknown=10, NotChecked=50, Total=756 [2022-11-20 11:42:18,373 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:42:18,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 83 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2022-11-20 11:42:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-20 11:42:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-11-20 11:42:18,385 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-20 11:42:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-11-20 11:42:18,386 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2022-11-20 11:42:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:42:18,386 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-11-20 11:42:18,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-11-20 11:42:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 11:42:18,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:42:18,388 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:42:18,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 11:42:18,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:42:18,602 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:42:18,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:42:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 9 times [2022-11-20 11:42:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:42:18,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415251933] [2022-11-20 11:42:18,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:42:18,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:42:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:42:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:18,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:42:18,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415251933] [2022-11-20 11:42:18,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415251933] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:42:18,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148714710] [2022-11-20 11:42:18,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:42:18,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:42:18,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:42:18,818 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:42:18,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 11:42:18,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-20 11:42:18,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:42:18,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:42:18,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:42:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:19,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:42:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:19,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148714710] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:42:19,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:42:19,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-11-20 11:42:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419625469] [2022-11-20 11:42:19,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:42:19,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 11:42:19,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:42:19,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 11:42:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:42:19,244 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:42:19,598 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-11-20 11:42:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 11:42:19,598 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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 33 [2022-11-20 11:42:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:42:19,599 INFO L225 Difference]: With dead ends: 69 [2022-11-20 11:42:19,599 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 11:42:19,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-11-20 11:42:19,600 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 61 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:42:19,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 25 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:42:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 11:42:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2022-11-20 11:42:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 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-20 11:42:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-20 11:42:19,616 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2022-11-20 11:42:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:42:19,617 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-20 11:42:19,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-20 11:42:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:42:19,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:42:19,618 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:42:19,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 11:42:19,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 11:42:19,823 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:42:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:42:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 10 times [2022-11-20 11:42:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:42:19,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005895189] [2022-11-20 11:42:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:42:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:42:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:42:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:20,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:42:20,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005895189] [2022-11-20 11:42:20,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005895189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:42:20,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314194599] [2022-11-20 11:42:20,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:42:20,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:42:20,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:42:20,018 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:42:20,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 11:42:20,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:42:20,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:42:20,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:42:20,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:42:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:20,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:42:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:20,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314194599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:42:20,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:42:20,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-11-20 11:42:20,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819170794] [2022-11-20 11:42:20,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:42:20,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 11:42:20,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:42:20,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 11:42:20,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:42:20,412 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:42:20,609 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-11-20 11:42:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:42:20,610 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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-20 11:42:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:42:20,610 INFO L225 Difference]: With dead ends: 78 [2022-11-20 11:42:20,610 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 11:42:20,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-11-20 11:42:20,612 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:42:20,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 41 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:42:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 11:42:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-11-20 11:42:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 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-20 11:42:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-11-20 11:42:20,622 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2022-11-20 11:42:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:42:20,622 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-11-20 11:42:20,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:42:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-11-20 11:42:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:42:20,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:42:20,623 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:42:20,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 11:42:20,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 11:42:20,830 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:42:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:42:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 11 times [2022-11-20 11:42:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:42:20,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266196749] [2022-11-20 11:42:20,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:42:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:42:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:42:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:22,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:42:22,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266196749] [2022-11-20 11:42:22,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266196749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:42:22,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438800723] [2022-11-20 11:42:22,248 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:42:22,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:42:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:42:22,250 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:42:22,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 11:42:22,401 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-20 11:42:22,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:42:22,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-20 11:42:22,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:42:22,413 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-20 11:42:22,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:42:22,464 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-20 11:42:22,522 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-20 11:42:22,582 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-20 11:42:22,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:42:22,700 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-20 11:42:22,887 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-20 11:42:23,140 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:42:23,141 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 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-20 11:42:23,525 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-20 11:42:23,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 59 [2022-11-20 11:42:24,022 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-20 11:42:24,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 74 [2022-11-20 11:42:24,618 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-20 11:42:24,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 90 [2022-11-20 11:42:27,449 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-20 11:42:27,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 44 [2022-11-20 11:42:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:27,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:43:12,919 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_215| Int) (|v_ULTIMATE.start_main_~i~0#1_214| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_217| Int) (|v_ULTIMATE.start_main_~i~0#1_216| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_217| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_215| 4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_214| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_213| 4))))) (or (< (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (+ 5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (not (<= |v_ULTIMATE.start_main_~i~0#1_213| (+ |v_ULTIMATE.start_main_~i~0#1_214| 1))) (not (= .cse3 4)) (< |v_ULTIMATE.start_main_~i~0#1_213| |c_ULTIMATE.start_main_~i~0#1|) (not (= .cse2 4)) (not (= .cse1 4)) (not (= 4 .cse5)) (not (<= |v_ULTIMATE.start_main_~i~0#1_216| (+ |v_ULTIMATE.start_main_~i~0#1_217| 1))) (not (= .cse0 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_214| (+ |v_ULTIMATE.start_main_~i~0#1_215| 1))) (not (<= |v_ULTIMATE.start_main_~i~0#1_215| (+ |v_ULTIMATE.start_main_~i~0#1_216| 1))) (not (<= |v_ULTIMATE.start_main_~i~0#1_217| 0))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_215| Int) (|v_ULTIMATE.start_main_~i~0#1_214| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_217| Int) (|v_ULTIMATE.start_main_~i~0#1_216| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_217| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse14 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse8 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_215| 4))))) (let ((.cse11 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse9 .cse8 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_214| 4)))) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_213| 4))) (let ((.cse10 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse9 .cse8 .cse14 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse12)))) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_213| (+ |v_ULTIMATE.start_main_~i~0#1_214| 1))) (not (= .cse8 4)) (< |v_ULTIMATE.start_main_~i~0#1_213| |c_ULTIMATE.start_main_~i~0#1|) (not (= .cse9 4)) (not (= .cse10 4)) (not (= 4 .cse11)) (< (+ .cse12 3) (+ .cse13 .cse10 .cse9 .cse8 .cse14 .cse11)) (not (<= |v_ULTIMATE.start_main_~i~0#1_216| (+ |v_ULTIMATE.start_main_~i~0#1_217| 1))) (not (= .cse13 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_214| (+ |v_ULTIMATE.start_main_~i~0#1_215| 1))) (not (<= |v_ULTIMATE.start_main_~i~0#1_215| (+ |v_ULTIMATE.start_main_~i~0#1_216| 1))) (not (<= |v_ULTIMATE.start_main_~i~0#1_217| 0)))))))))))) is different from false [2022-11-20 11:43:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 43 refuted. 12 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 11:43:44,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438800723] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:43:44,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:43:44,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 72 [2022-11-20 11:43:44,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457753607] [2022-11-20 11:43:44,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:43:44,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-20 11:43:44,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:44,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-20 11:43:44,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=4499, Unknown=89, NotChecked=138, Total=5112 [2022-11-20 11:43:44,677 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:00,298 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-11-20 11:44:00,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 11:44:00,298 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 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-20 11:44:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:00,299 INFO L225 Difference]: With dead ends: 69 [2022-11-20 11:44:00,299 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 11:44:00,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 91.2s TimeCoverageRelationStatistics Valid=746, Invalid=7722, Unknown=92, NotChecked=182, Total=8742 [2022-11-20 11:44:00,303 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:00,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 128 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 324 Invalid, 0 Unknown, 408 Unchecked, 0.3s Time] [2022-11-20 11:44:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 11:44:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2022-11-20 11:44:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 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-20 11:44:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-11-20 11:44:00,312 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 36 [2022-11-20 11:44:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:00,312 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-11-20 11:44:00,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-11-20 11:44:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:44:00,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:00,313 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:00,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 11:44:00,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:44:00,518 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:44:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash 83735393, now seen corresponding path program 6 times [2022-11-20 11:44:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:00,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169308234] [2022-11-20 11:44:00,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:00,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:00,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:44:00,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497219375] [2022-11-20 11:44:00,533 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:44:00,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:44:00,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:44:00,534 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:44:00,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 11:44:00,689 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-20 11:44:00,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:44:00,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-20 11:44:00,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:44:00,773 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-20 11:44:00,813 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 11:44:00,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 11:44:02,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:44:02,976 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 27 treesize of output 27 [2022-11-20 11:44:03,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:44:03,849 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 27 treesize of output 27 [2022-11-20 11:44:04,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:44:04,733 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 27 treesize of output 27 [2022-11-20 11:44:05,512 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-20 11:44:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:44:05,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:44:05,573 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-11-20 11:44:05,622 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-11-20 11:44:05,747 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-20 11:44:05,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-20 11:44:05,768 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-20 11:44:05,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2022-11-20 11:44:05,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:44:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 26 refuted. 2 times theorem prover too weak. 2 trivial. 12 not checked. [2022-11-20 11:44:05,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:05,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169308234] [2022-11-20 11:44:05,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:44:05,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497219375] [2022-11-20 11:44:05,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497219375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:44:05,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:44:05,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2022-11-20 11:44:05,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753380022] [2022-11-20 11:44:05,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:44:05,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 11:44:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 11:44:05,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=422, Unknown=12, NotChecked=86, Total=600 [2022-11-20 11:44:05,914 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:06,158 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-11-20 11:44:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:44:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 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-20 11:44:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:06,159 INFO L225 Difference]: With dead ends: 54 [2022-11-20 11:44:06,159 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 11:44:06,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=110, Invalid=642, Unknown=12, NotChecked=106, Total=870 [2022-11-20 11:44:06,160 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:06,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2022-11-20 11:44:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 11:44:06,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-20 11:44:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 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-20 11:44:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-11-20 11:44:06,173 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 36 [2022-11-20 11:44:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:06,174 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-11-20 11:44:06,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-11-20 11:44:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:44:06,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:06,175 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:06,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 11:44:06,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:44:06,380 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:44:06,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash 465948487, now seen corresponding path program 12 times [2022-11-20 11:44:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:06,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450553155] [2022-11-20 11:44:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:06,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450553155] [2022-11-20 11:44:06,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450553155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:44:06,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79436827] [2022-11-20 11:44:06,605 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 11:44:06,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:44:06,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:44:06,606 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:44:06,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 11:44:06,788 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-20 11:44:06,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:44:06,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 11:44:06,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:44:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:07,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:44:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:07,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79436827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:44:07,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:44:07,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-11-20 11:44:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968501354] [2022-11-20 11:44:07,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:44:07,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 11:44:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:44:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 11:44:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-11-20 11:44:07,168 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 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-20 11:44:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:44:07,414 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-11-20 11:44:07,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:44:07,415 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 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 39 [2022-11-20 11:44:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:44:07,415 INFO L225 Difference]: With dead ends: 86 [2022-11-20 11:44:07,416 INFO L226 Difference]: Without dead ends: 55 [2022-11-20 11:44:07,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2022-11-20 11:44:07,417 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 75 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:44:07,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 28 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:44:07,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-20 11:44:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-11-20 11:44:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 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-20 11:44:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-20 11:44:07,429 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 39 [2022-11-20 11:44:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:44:07,430 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-20 11:44:07,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 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-20 11:44:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-20 11:44:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:44:07,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:44:07,431 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:44:07,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 11:44:07,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:44:07,634 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:44:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:44:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -552579063, now seen corresponding path program 13 times [2022-11-20 11:44:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:44:07,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376526415] [2022-11-20 11:44:07,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:44:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:44:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:09,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:44:09,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376526415] [2022-11-20 11:44:09,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376526415] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:44:09,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045021747] [2022-11-20 11:44:09,291 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 11:44:09,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:44:09,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:44:09,292 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:44:09,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 11:44:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:44:09,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-20 11:44:09,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:44:09,418 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-20 11:44:09,425 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-20 11:44:09,432 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-20 11:44:09,462 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-20 11:44:09,487 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-20 11:44:09,506 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-20 11:44:09,529 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-20 11:44:09,555 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-20 11:44:09,812 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-20 11:44:09,984 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:44:09,984 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 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-20 11:44:10,188 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:44:10,188 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 1 case distinctions, treesize of input 65 treesize of output 43 [2022-11-20 11:44:10,422 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-20 11:44:10,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2022-11-20 11:44:10,687 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-20 11:44:10,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2022-11-20 11:44:10,908 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:44:10,908 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 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-20 11:44:11,056 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:44:11,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2022-11-20 11:44:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:11,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:45:27,293 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse1 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse4 .cse1 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= .cse3 4)) (not (= .cse4 4)) (not (= .cse5 4)) (< (+ .cse6 3) (+ .cse3 .cse2 .cse5 .cse4 .cse1 .cse7 .cse0)))))))))))) (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse14 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse14 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (< (+ .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (+ 5 .cse6)) (not (= .cse13 4)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= 4 .cse16)) (not (= .cse15 4)) (not (= .cse10 4)))))))))))))) is different from false [2022-11-20 11:45:28,080 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (< (+ 7 .cse0) (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= 4 .cse7)) (not (= .cse5 4)) (not (= .cse2 4)) (not (= .cse1 4)) (not (= .cse4 4)) (not (= .cse3 4)))))))))))) (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse10 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse10 .cse16 .cse14 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse10 .cse16 .cse14 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse10 4)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= 4 .cse13)) (not (= .cse14 4)) (< (+ .cse15 .cse11 .cse12 .cse10 .cse16 .cse14 .cse13) (+ .cse0 9)) (not (= .cse15 4)))))))))))))) is different from false [2022-11-20 11:45:29,349 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse1 .cse3 .cse0 .cse4 .cse5 .cse6) (+ .cse7 13)) (not (= .cse3 4)) (not (= 4 .cse6)) (not (= .cse5 4)) (not (= .cse2 4)))))))))))) (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse14 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 4 .cse10)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse13 4)) (not (= .cse14 4)) (not (= .cse15 4)) (< (+ .cse7 11) (+ .cse13 .cse12 .cse15 .cse14 .cse11 .cse16 .cse10)))))))))))))) is different from false [2022-11-20 11:45:30,428 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse1 .cse3 .cse0 .cse4 .cse5 .cse6) (+ .cse7 17)) (not (= .cse3 4)) (not (= 4 .cse6)) (not (= .cse5 4)) (not (= .cse2 4)))))))))))) (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse14 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 4 .cse10)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse13 4)) (not (= .cse14 4)) (not (= .cse15 4)) (< (+ .cse7 15) (+ .cse13 .cse12 .cse15 .cse14 .cse11 .cse16 .cse10)))))))))))))) is different from false [2022-11-20 11:45:31,750 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse5 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse5 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= 4 .cse3)) (< (+ .cse4 .cse1 .cse2 .cse0 .cse5 .cse6 .cse3) (+ .cse7 21)) (not (= .cse6 4)) (not (= .cse4 4)))))))))))) (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse15 .cse14 .cse11 .cse16 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 4 .cse10)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse13 4)) (not (= .cse14 4)) (not (= .cse15 4)) (< (+ 19 .cse7) (+ .cse13 .cse12 .cse15 .cse14 .cse11 .cse16 .cse10)))))))))))))) is different from false [2022-11-20 11:45:32,956 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_subst_9 Int) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_subst_16 Int) (v_subst_7 Int) (v_ArrVal_909 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_909 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4))))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 4 .cse0)) (< (+ 23 .cse1) (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse0)) (not (= .cse6 4)) (not (= .cse3 4)) (not (= .cse2 4)) (not (= .cse5 4)) (not (= .cse4 4)))))))))))) (forall ((v_subst_15 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (|v_ULTIMATE.start_main_~i~0#1_288| Int) (v_subst_8 Int) (v_subst_11 Int) (v_ArrVal_909 (Array Int Int)) (v_subst_10 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_909))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select v_ArrVal_909 (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse10 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse10 .cse16 .cse14 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse10 .cse16 .cse14 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse10 4)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= 4 .cse13)) (not (= .cse14 4)) (not (= .cse15 4)) (< (+ .cse15 .cse11 .cse12 .cse10 .cse16 .cse14 .cse13) (+ .cse1 25)))))))))))))) is different from false [2022-11-20 11:45:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-11-20 11:45:33,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045021747] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:45:33,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:45:33,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 24] total 66 [2022-11-20 11:45:33,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044219463] [2022-11-20 11:45:33,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:45:33,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-20 11:45:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:45:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-20 11:45:33,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3305, Unknown=28, NotChecked=726, Total=4290 [2022-11-20 11:45:33,540 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:38,869 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-11-20 11:45:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 11:45:38,870 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-20 11:45:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:38,871 INFO L225 Difference]: With dead ends: 74 [2022-11-20 11:45:38,871 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 11:45:38,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 80.7s TimeCoverageRelationStatistics Valid=271, Invalid=3631, Unknown=28, NotChecked=762, Total=4692 [2022-11-20 11:45:38,873 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 649 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:38,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 251 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 447 Invalid, 0 Unknown, 649 Unchecked, 1.3s Time] [2022-11-20 11:45:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 11:45:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-11-20 11:45:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-11-20 11:45:38,898 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 41 [2022-11-20 11:45:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:38,898 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-11-20 11:45:38,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-11-20 11:45:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:45:38,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:38,900 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:45:38,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 11:45:39,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:45:39,105 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:45:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash 127479307, now seen corresponding path program 7 times [2022-11-20 11:45:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:45:39,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366193195] [2022-11-20 11:45:39,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:45:39,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:45:39,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375491869] [2022-11-20 11:45:39,126 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 11:45:39,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:45:39,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:45:39,128 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:45:39,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 11:45:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:39,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 11:45:39,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:39,298 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-20 11:45:39,657 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 15 treesize of output 11 [2022-11-20 11:45:39,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 11:45:40,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:45:40,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:45:40,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:45:40,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:45:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:45:40,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:45:41,517 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (or (forall ((v_ArrVal_992 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) (forall ((v_ArrVal_993 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))))) is different from false [2022-11-20 11:45:41,556 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (or (forall ((v_ArrVal_992 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) (forall ((v_ArrVal_993 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))))) is different from false [2022-11-20 11:45:41,832 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (or (forall ((v_ArrVal_992 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) (forall ((v_ArrVal_993 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))))) is different from false [2022-11-20 11:45:42,117 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_987 Int) (v_ArrVal_992 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_987)))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (not (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))))) is different from false [2022-11-20 11:45:42,146 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_987 Int) (v_ArrVal_992 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_987)))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (not (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))))) is different from false [2022-11-20 11:45:42,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:45:42,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 51 [2022-11-20 11:45:42,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:45:42,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 66 [2022-11-20 11:45:42,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:45:42,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-20 11:45:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 42 not checked. [2022-11-20 11:45:42,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:45:42,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366193195] [2022-11-20 11:45:42,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:45:42,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375491869] [2022-11-20 11:45:42,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375491869] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:45:42,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:45:42,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2022-11-20 11:45:42,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741688315] [2022-11-20 11:45:42,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:45:42,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 11:45:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:45:42,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 11:45:42,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=663, Unknown=12, NotChecked=280, Total=1056 [2022-11-20 11:45:42,921 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:44,565 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-11-20 11:45:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:45:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-20 11:45:44,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:44,566 INFO L225 Difference]: With dead ends: 74 [2022-11-20 11:45:44,566 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 11:45:44,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=101, Invalid=663, Unknown=12, NotChecked=280, Total=1056 [2022-11-20 11:45:44,567 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:44,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 131 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 497 Invalid, 0 Unknown, 315 Unchecked, 1.4s Time] [2022-11-20 11:45:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 11:45:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-11-20 11:45:44,586 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-20 11:45:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-20 11:45:44,587 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 41 [2022-11-20 11:45:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:44,587 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-20 11:45:44,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-20 11:45:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 11:45:44,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:44,588 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:45:44,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 11:45:44,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 11:45:44,794 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:45:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:44,795 INFO L85 PathProgramCache]: Analyzing trace with hash -105011125, now seen corresponding path program 14 times [2022-11-20 11:45:44,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:45:44,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460727669] [2022-11-20 11:45:44,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:45:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:45,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:45:45,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460727669] [2022-11-20 11:45:45,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460727669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:45:45,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099446706] [2022-11-20 11:45:45,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:45:45,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:45:45,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:45:45,541 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:45:45,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 11:45:45,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:45:45,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:45:45,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:45:45,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:46,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:45:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:47,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099446706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:45:47,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:45:47,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-11-20 11:45:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480105434] [2022-11-20 11:45:47,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:45:47,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:45:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:45:47,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:45:47,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-11-20 11:45:47,143 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:49,131 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-11-20 11:45:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 11:45:49,132 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-20 11:45:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:49,133 INFO L225 Difference]: With dead ends: 90 [2022-11-20 11:45:49,133 INFO L226 Difference]: Without dead ends: 86 [2022-11-20 11:45:49,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 11:45:49,135 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:49,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 31 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 11:45:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-20 11:45:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2022-11-20 11:45:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:49,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-11-20 11:45:49,159 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 43 [2022-11-20 11:45:49,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:49,159 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-11-20 11:45:49,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-11-20 11:45:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 11:45:49,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:49,160 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:45:49,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-20 11:45:49,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:45:49,361 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:45:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:49,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2029167523, now seen corresponding path program 15 times [2022-11-20 11:45:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:45:49,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592868152] [2022-11-20 11:45:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:45:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:50,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:45:50,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592868152] [2022-11-20 11:45:50,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592868152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:45:50,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818973382] [2022-11-20 11:45:50,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:45:50,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:45:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:45:50,193 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:45:50,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 11:45:50,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-20 11:45:50,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:45:50,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:45:50,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:51,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:45:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:51,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818973382] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:45:51,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:45:51,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-11-20 11:45:51,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104127460] [2022-11-20 11:45:51,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:45:51,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:45:51,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:45:51,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:45:51,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-11-20 11:45:51,924 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:52,867 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-11-20 11:45:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 11:45:52,867 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-20 11:45:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:52,868 INFO L225 Difference]: With dead ends: 97 [2022-11-20 11:45:52,868 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 11:45:52,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 11:45:52,870 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 92 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:52,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 37 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:45:52,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 11:45:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-11-20 11:45:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-11-20 11:45:52,891 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 44 [2022-11-20 11:45:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:52,891 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-11-20 11:45:52,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-11-20 11:45:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:45:52,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:52,892 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:45:52,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 11:45:53,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 11:45:53,092 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:45:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash -111213349, now seen corresponding path program 16 times [2022-11-20 11:45:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:45:53,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256514833] [2022-11-20 11:45:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:45:53,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:45:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:45:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:45:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:45:58,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256514833] [2022-11-20 11:45:58,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256514833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:45:58,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273321484] [2022-11-20 11:45:58,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:45:58,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:45:58,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:45:58,423 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:45:58,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 11:45:58,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:45:58,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:45:58,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-20 11:45:58,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:45:58,614 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-20 11:45:58,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:45:58,827 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-20 11:45:59,036 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-20 11:45:59,260 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-20 11:45:59,476 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-20 11:45:59,693 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-20 11:45:59,900 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-20 11:46:00,123 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-20 11:46:01,277 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-20 11:46:02,153 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:46:02,153 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 1 case distinctions, treesize of input 55 treesize of output 41 [2022-11-20 11:46:03,195 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-20 11:46:03,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 55 [2022-11-20 11:46:04,408 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-11-20 11:46:04,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 71 [2022-11-20 11:46:05,839 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-20 11:46:05,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 98 treesize of output 85 [2022-11-20 11:46:07,603 INFO L321 Elim1Store]: treesize reduction 180, result has 0.6 percent of original size [2022-11-20 11:46:07,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 99 [2022-11-20 11:46:10,620 INFO L321 Elim1Store]: treesize reduction 252, result has 0.4 percent of original size [2022-11-20 11:46:10,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 120 treesize of output 113 [2022-11-20 11:46:11,658 INFO L321 Elim1Store]: treesize reduction 252, result has 0.4 percent of original size [2022-11-20 11:46:11,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 113 treesize of output 45 [2022-11-20 11:46:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:46:11,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:48:38,065 WARN L233 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:49:37,218 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:49:40,221 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse4 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse2 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse2 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse3 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (< (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5 .cse6 .cse7) (+ .cse8 13)) (not (= .cse4 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse7)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse5)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|)))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse19 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse18 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse18 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse12 4)) (not (= 4 .cse13)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse14 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse15 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (not (= .cse16 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse17)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse18)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|) (< (+ .cse8 11) (+ .cse14 .cse15 .cse12 .cse16 .cse13 .cse18 .cse19 .cse17))))))))))))))) is different from false [2022-11-20 11:49:43,415 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse7 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse4 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse6 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse2 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse6 .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse2 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse3 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (not (= .cse4 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse5)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse6)) (< (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse6 .cse7 .cse5) (+ .cse8 17)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|)))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse18 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse12 4)) (not (= 4 .cse13)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse14 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse15 4)) (< (+ .cse8 15) (+ .cse14 .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (not (= .cse16 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse19)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse17)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|)))))))))))))) is different from false [2022-11-20 11:49:46,918 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse7 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse6 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5 .cse1 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse2 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5 .cse1 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse2 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse3 4)) (< (+ 19 .cse4) (+ .cse2 .cse3 .cse0 .cse5 .cse1 .cse6 .cse7 .cse8)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (not (= .cse5 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse8)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= 4 .cse6))))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse18 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse12 4)) (not (= 4 .cse13)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse14 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse15 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (< (+ .cse14 .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19) (+ .cse4 21)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (not (= .cse16 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse19)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= 4 .cse17))))))))))))))) is different from false [2022-11-20 11:49:50,248 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse4 (+ 5 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse9 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse6 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse9 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5 .cse1 .cse9 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse2 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse5 .cse1 .cse7 .cse9 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse2 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse3 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= .cse5 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse6)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse7)) (< (+ 23 .cse8) (+ .cse2 .cse3 .cse0 .cse5 .cse1 .cse7 .cse9 .cse6))))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse18 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse12 4)) (not (= 4 .cse13)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse14 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse15 4)) (< (+ .cse14 .cse15 .cse12 .cse16 .cse13 .cse17 .cse18 .cse19) (+ .cse8 25)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= .cse16 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse19)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse17))))))))))))))) is different from false [2022-11-20 11:49:53,753 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 6 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse4 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse5 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse2 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse1 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse2 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse3 4)) (< (+ .cse2 .cse3 .cse0 .cse4 .cse1 .cse5 .cse6 .cse7) (+ .cse8 29)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= .cse4 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse7)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse5))))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int) (|v_ULTIMATE.start_main_~i~0#1_388| Int) (v_ArrVal_1206 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_387| Int) (|v_ULTIMATE.start_main_~i~0#1_386| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (|v_ULTIMATE.start_main_~i~0#1_391| Int) (|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1206))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_1206 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_392| 4)))) (.cse19 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_390| 4))))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_389| 4))))) (let ((.cse16 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse13 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_388| 4))))) (let ((.cse18 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_387| 4))))) (let ((.cse14 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse12 .cse16 .cse13 .cse18 .cse19 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_386| 4))))) (or (not (= .cse12 4)) (not (= 4 .cse13)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse14 4)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse15 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (< .cse9 |v_ULTIMATE.start_main_~i~0#1_386|) (not (= .cse16 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) |v_ULTIMATE.start_main_~i~0#1_391|)) (not (= 4 .cse17)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= 4 .cse18)) (< (+ .cse8 27) (+ .cse14 .cse15 .cse12 .cse16 .cse13 .cse18 .cse19 .cse17))))))))))))))) is different from false [2022-11-20 11:49:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2022-11-20 11:49:55,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273321484] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:49:55,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:49:55,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 96 [2022-11-20 11:49:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987173168] [2022-11-20 11:49:55,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:49:55,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-11-20 11:49:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:49:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-11-20 11:49:55,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=7614, Unknown=20, NotChecked=910, Total=9120 [2022-11-20 11:49:55,286 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 96 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 96 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:34,307 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 124 DAG size of output: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:51:13,006 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:51:51,504 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:52:33,419 WARN L233 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:53:10,901 WARN L233 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:55:03,870 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:55:43,065 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 126 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:56:06,389 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (* c_~N~0 4)) (.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_387| Int)) (let ((.cse0 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_387| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse0 4)) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_387|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (<= (+ .cse2 .cse3 .cse0) .cse4) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= .cse3 4)))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int)) (let ((.cse10 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_389| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_388| Int)) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_388| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_387| Int)) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_387| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse7 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse2 .cse7 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (not (= 4 .cse8)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (<= .cse4 (+ .cse9 .cse2 .cse7 .cse10 .cse8)))))))) (not (= .cse9 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|))))) (not (= 4 .cse10)) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_389|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse11 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse11 4)) (<= (+ .cse2 .cse11) .cse4) (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_386|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int)) (let ((.cse12 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_389| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse12)) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_389|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_388| Int)) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_388| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_387| Int)) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse2 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_387| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse2 .cse15 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (not (= 4 .cse13)) (<= (+ .cse14 .cse2 .cse15 .cse12 .cse13) .cse4) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|))))) (not (= .cse15 4))))) (not (= .cse14 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse16 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_390| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse16 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int)) (let ((.cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_389| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_388| Int)) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse19 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_388| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse17 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_387| Int)) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse19 .cse17 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_387| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse18 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse19 .cse17 .cse18 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (<= .cse4 (+ .cse2 .cse19 .cse17 .cse18 .cse16 .cse20)) (not (= .cse20 4))))))))))) (not (= .cse19 4))))) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_390|))))) (<= c_~N~0 7) (forall ((|v_ULTIMATE.start_main_~i~0#1_391| Int)) (let ((.cse26 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_391|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse21 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_390| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse21 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int)) (let ((.cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse21 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_389| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_388| Int)) (let ((.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse21 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_388| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (= .cse22 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_387| Int)) (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse21 .cse25 .cse22 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_387| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse23 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse21 .cse23 .cse25 .cse22 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (<= (+ .cse2 .cse24 .cse21 .cse23 .cse25 .cse22 .cse26) .cse4) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= .cse24 4))))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (= .cse25 4)))))))) (not (= .cse26 4))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse27 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_390| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse27 4)) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_390|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int)) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_389| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_388| Int)) (let ((.cse28 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse30 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_388| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse28 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_387| Int)) (let ((.cse29 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse30 .cse28 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_387| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse29 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse30 .cse28 .cse29 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (<= (+ .cse2 .cse30 .cse28 .cse29 .cse27 .cse31) .cse4) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= .cse31 4))))))))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (= .cse30 4)))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_388| Int)) (let ((.cse34 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_388| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_388|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_387| Int)) (let ((.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_387| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse32 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse32 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= .cse4 (+ .cse2 .cse32 .cse33 .cse34)) (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (not (= .cse33 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)))))))) (not (= .cse34 4))))) (= .cse2 28) (forall ((|v_ULTIMATE.start_main_~i~0#1_387| Int)) (let ((.cse35 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_387| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse35 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (<= .cse4 (+ .cse2 .cse36 .cse35)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (not (= .cse36 4))))) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_387|))))) (exists ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_379| Int) (|v_ULTIMATE.start_main_~i~0#1_384| Int) (|v_ULTIMATE.start_main_~i~0#1_381| Int) (|v_ULTIMATE.start_main_~i~0#1_380| Int) (|v_ULTIMATE.start_main_~i~0#1_383| Int) (|v_ULTIMATE.start_main_~i~0#1_382| Int)) (let ((.cse37 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse37 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_383| 4))) 4) (= (select .cse37 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 4) (<= (+ |v_ULTIMATE.start_main_~i~0#1_383| 1) |v_ULTIMATE.start_main_~i~0#1_384|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_381| 1) |v_ULTIMATE.start_main_~i~0#1_382|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_384| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_380| 1) |v_ULTIMATE.start_main_~i~0#1_381|) (= (select .cse37 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_381| 4))) 4) (<= (+ |v_ULTIMATE.start_main_~i~0#1_382| 1) |v_ULTIMATE.start_main_~i~0#1_383|) (= (select .cse37 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_382| 4))) 4) (<= (+ |v_ULTIMATE.start_main_~i~0#1_379| 1) |v_ULTIMATE.start_main_~i~0#1_380|) (= (select .cse37 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_384| 4))) 4) (< |ULTIMATE.start_main_~i~0#1| c_~N~0) (= (select .cse37 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_380| 4))) 4) (= (select .cse37 (+ (* |v_ULTIMATE.start_main_~i~0#1_379| 4) |ULTIMATE.start_main_~a~0#1.offset|)) 4) (<= 0 |v_ULTIMATE.start_main_~i~0#1_379|) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_391| Int)) (let ((.cse43 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_391| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_391|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_390| Int)) (let ((.cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_390| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse38 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_391| 1) |v_ULTIMATE.start_main_~i~0#1_390|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_389| Int)) (let ((.cse39 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse38 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_389| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_390| 1) |v_ULTIMATE.start_main_~i~0#1_389|)) (not (= .cse39 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_388| Int)) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse38 .cse39 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_388| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_387| Int)) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse38 .cse39 .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_387| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse40 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse38 .cse41 .cse39 .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)) (<= .cse4 (+ .cse2 .cse40 .cse38 .cse41 .cse39 .cse42 .cse43)) (not (= .cse40 4))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse41 4))))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_389| 1) |v_ULTIMATE.start_main_~i~0#1_388|)) (not (= .cse42 4))))))))))) (not (= .cse43 4))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse44 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse44 4)) (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_386|)) (<= .cse4 (+ .cse2 .cse44))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_388| Int)) (let ((.cse45 (select .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_388| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_388|)) (not (= .cse45 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_387| Int)) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_387| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_388| 1) |v_ULTIMATE.start_main_~i~0#1_387|)) (not (= .cse46 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_386| Int)) (let ((.cse47 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse46 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_386| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_386| c_~N~0)) (<= (+ .cse2 .cse46 .cse47 .cse45) .cse4) (not (= .cse47 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_387| 1) |v_ULTIMATE.start_main_~i~0#1_386|)))))))))))))) is different from true [2022-11-20 11:56:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:56:24,745 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2022-11-20 11:56:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-20 11:56:24,746 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 96 states have internal predecessors, (124), 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 46 [2022-11-20 11:56:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:56:24,747 INFO L225 Difference]: With dead ends: 100 [2022-11-20 11:56:24,747 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 11:56:24,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3599 ImplicationChecksByTransitivity, 600.0s TimeCoverageRelationStatistics Valid=1190, Invalid=15583, Unknown=21, NotChecked=1566, Total=18360 [2022-11-20 11:56:24,749 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 780 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:56:24,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 164 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 440 Invalid, 0 Unknown, 780 Unchecked, 1.2s Time] [2022-11-20 11:56:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 11:56:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-20 11:56:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:56:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-11-20 11:56:24,777 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 46 [2022-11-20 11:56:24,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:56:24,777 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-11-20 11:56:24,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 96 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:56:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-11-20 11:56:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:56:24,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:56:24,778 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:56:24,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-20 11:56:24,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 11:56:24,985 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:56:24,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:56:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash 568845021, now seen corresponding path program 8 times [2022-11-20 11:56:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:56:24,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900242685] [2022-11-20 11:56:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:56:24,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:56:25,000 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:56:25,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956969752] [2022-11-20 11:56:25,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:56:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:56:25,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:56:25,002 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:56:25,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56231d8a-f94f-4185-97af-91bdb2c7e08c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 11:56:25,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:56:25,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:56:25,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-20 11:56:25,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:56:25,581 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-20 11:56:25,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:25,752 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-20 11:56:26,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:26,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:56:26,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:26,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:56:26,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:26,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:56:26,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:26,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:56:26,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:56:26,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:56:26,859 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-20 11:56:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:56:26,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:56:27,143 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1299 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-11-20 11:56:27,305 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-11-20 11:56:27,331 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-11-20 11:56:27,356 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-11-20 11:56:30,058 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-20 11:56:30,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-20 11:56:30,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:56:30,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-11-20 11:56:30,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3