./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-tiling/rewnif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-tiling/rewnif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ee21d1db2a363655b71bcb8ab92ef8d6b86a57a4ebbd79d98cb55c59d3ed1f5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:59:13,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:59:13,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:59:13,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:59:13,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:59:13,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:59:13,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:59:13,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:59:13,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:59:13,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:59:13,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:59:13,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:59:13,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:59:13,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:59:13,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:59:13,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:59:13,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:59:13,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:59:13,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:59:13,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:59:13,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:59:13,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:59:13,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:59:13,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:59:13,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:59:13,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:59:13,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:59:13,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:59:13,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:59:13,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:59:13,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:59:13,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:59:13,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:59:13,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:59:13,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:59:13,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:59:13,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:59:13,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:59:13,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:59:13,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:59:13,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:59:13,492 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 13:59:13,520 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:59:13,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:59:13,520 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:59:13,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:59:13,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:59:13,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:59:13,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:59:13,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:59:13,523 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:59:13,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:59:13,524 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:59:13,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:59:13,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:59:13,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:59:13,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:59:13,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:59:13,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:59:13,526 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:59:13,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:59:13,526 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:59:13,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:59:13,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:59:13,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:59:13,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:59:13,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:59:13,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:59:13,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:59:13,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:59:13,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:59:13,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:59:13,530 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:59:13,530 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:59:13,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:59:13,530 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_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ee21d1db2a363655b71bcb8ab92ef8d6b86a57a4ebbd79d98cb55c59d3ed1f5 [2022-11-21 13:59:13,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:59:13,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:59:13,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:59:13,857 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:59:13,858 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:59:13,860 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/array-tiling/rewnif.c [2022-11-21 13:59:17,205 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:59:17,574 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:59:17,575 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/sv-benchmarks/c/array-tiling/rewnif.c [2022-11-21 13:59:17,584 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/data/302cfa2ec/b964f2de3a924659b326afa1886f89bd/FLAGf300a6c5a [2022-11-21 13:59:17,606 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/data/302cfa2ec/b964f2de3a924659b326afa1886f89bd [2022-11-21 13:59:17,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:59:17,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:59:17,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:59:17,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:59:17,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:59:17,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:17,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56219cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17, skipping insertion in model container [2022-11-21 13:59:17,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:17,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:59:17,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:59:17,878 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_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/sv-benchmarks/c/array-tiling/rewnif.c[397,410] [2022-11-21 13:59:17,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:59:17,908 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:59:17,922 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_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/sv-benchmarks/c/array-tiling/rewnif.c[397,410] [2022-11-21 13:59:17,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:59:17,943 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:59:17,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17 WrapperNode [2022-11-21 13:59:17,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:59:17,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:59:17,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:59:17,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:59:17,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:17,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:17,978 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-11-21 13:59:17,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:59:17,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:59:17,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:59:17,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:59:17,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:17,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:17,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:17,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:17,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:18,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:18,003 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:18,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:18,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:59:18,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:59:18,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:59:18,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:59:18,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (1/1) ... [2022-11-21 13:59:18,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:59:18,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:18,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:59:18,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:59:18,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:59:18,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:59:18,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:59:18,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:59:18,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:59:18,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:59:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:59:18,173 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:59:18,176 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:59:18,424 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:59:18,431 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:59:18,431 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 13:59:18,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:59:18 BoogieIcfgContainer [2022-11-21 13:59:18,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:59:18,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:59:18,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:59:18,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:59:18,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:59:17" (1/3) ... [2022-11-21 13:59:18,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7baccb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:59:18, skipping insertion in model container [2022-11-21 13:59:18,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:17" (2/3) ... [2022-11-21 13:59:18,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7baccb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:59:18, skipping insertion in model container [2022-11-21 13:59:18,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:59:18" (3/3) ... [2022-11-21 13:59:18,453 INFO L112 eAbstractionObserver]: Analyzing ICFG rewnif.c [2022-11-21 13:59:18,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:59:18,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 13:59:18,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:59:18,564 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;@70bd1c10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:59:18,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 13:59:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 13:59:18,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:18,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:18,578 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash 133671584, now seen corresponding path program 1 times [2022-11-21 13:59:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:18,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458436638] [2022-11-21 13:59:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:18,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:18,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458436638] [2022-11-21 13:59:18,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458436638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:18,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:18,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:59:18,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982525894] [2022-11-21 13:59:18,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:18,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:59:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:59:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:59:18,888 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:18,911 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-11-21 13:59:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:59:18,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-11-21 13:59:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:18,925 INFO L225 Difference]: With dead ends: 29 [2022-11-21 13:59:18,925 INFO L226 Difference]: Without dead ends: 14 [2022-11-21 13:59:18,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:59:18,935 INFO L413 NwaCegarLoop]: 21 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, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:18,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:59:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-21 13:59:18,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-21 13:59:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-11-21 13:59:18,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2022-11-21 13:59:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:18,982 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-21 13:59:18,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-11-21 13:59:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 13:59:18,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:18,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:18,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:59:18,985 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:18,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash 121665811, now seen corresponding path program 1 times [2022-11-21 13:59:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:18,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127403455] [2022-11-21 13:59:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:19,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:19,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127403455] [2022-11-21 13:59:19,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127403455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:19,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:19,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:59:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723948496] [2022-11-21 13:59:19,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:19,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:59:19,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:19,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:59:19,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:59:19,157 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:19,195 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-11-21 13:59:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:59:19,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-11-21 13:59:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:19,196 INFO L225 Difference]: With dead ends: 29 [2022-11-21 13:59:19,197 INFO L226 Difference]: Without dead ends: 18 [2022-11-21 13:59:19,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:59:19,198 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:19,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:59:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-21 13:59:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-11-21 13:59:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-11-21 13:59:19,204 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2022-11-21 13:59:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:19,204 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-11-21 13:59:19,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-11-21 13:59:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 13:59:19,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:19,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:19,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:59:19,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash 729197006, now seen corresponding path program 1 times [2022-11-21 13:59:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:19,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67581726] [2022-11-21 13:59:19,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:19,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:19,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67581726] [2022-11-21 13:59:19,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67581726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:19,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108434800] [2022-11-21 13:59:19,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:19,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:19,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:19,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:19,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:59:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:19,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 13:59:19,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:19,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:19,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108434800] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:19,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:19,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-21 13:59:19,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024390617] [2022-11-21 13:59:19,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:19,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:59:19,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:19,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:59:19,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:59:19,678 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:19,784 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-11-21 13:59:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:59:19,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-21 13:59:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:19,788 INFO L225 Difference]: With dead ends: 34 [2022-11-21 13:59:19,788 INFO L226 Difference]: Without dead ends: 27 [2022-11-21 13:59:19,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:59:19,792 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:19,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 22 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:59:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-21 13:59:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-11-21 13:59:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-21 13:59:19,805 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-11-21 13:59:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:19,807 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-21 13:59:19,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-21 13:59:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 13:59:19,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:19,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:19,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:20,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:20,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1021157689, now seen corresponding path program 1 times [2022-11-21 13:59:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:20,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723460441] [2022-11-21 13:59:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:20,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:20,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:20,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723460441] [2022-11-21 13:59:20,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723460441] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:20,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41247262] [2022-11-21 13:59:20,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:20,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:20,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:20,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:20,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:59:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:20,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-21 13:59:20,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:20,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 13:59:21,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:21,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 13:59:21,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:59:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:21,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:21,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-21 13:59:21,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2022-11-21 13:59:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:21,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41247262] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:21,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:21,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2022-11-21 13:59:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877517533] [2022-11-21 13:59:21,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:21,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 13:59:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:21,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 13:59:21,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:59:21,456 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:21,691 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-21 13:59:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:59:21,692 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 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 16 [2022-11-21 13:59:21,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:21,693 INFO L225 Difference]: With dead ends: 28 [2022-11-21 13:59:21,693 INFO L226 Difference]: Without dead ends: 26 [2022-11-21 13:59:21,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-11-21 13:59:21,694 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:21,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 40 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:59:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-21 13:59:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-11-21 13:59:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-21 13:59:21,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2022-11-21 13:59:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:21,700 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-21 13:59:21,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-21 13:59:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 13:59:21,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:21,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:21,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-21 13:59:21,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:21,907 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:21,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:21,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1566850755, now seen corresponding path program 1 times [2022-11-21 13:59:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:21,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019013891] [2022-11-21 13:59:21,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:21,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:22,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:22,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019013891] [2022-11-21 13:59:22,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019013891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:22,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790746505] [2022-11-21 13:59:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:22,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:22,250 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:22,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:59:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:22,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-21 13:59:22,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:22,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:59:22,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:59:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:22,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:22,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-21 13:59:22,636 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 24 treesize of output 20 [2022-11-21 13:59:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:22,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790746505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:22,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:22,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-11-21 13:59:22,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629241258] [2022-11-21 13:59:22,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:22,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 13:59:22,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 13:59:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:59:22,667 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:23,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:23,015 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-11-21 13:59:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 13:59:23,016 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-21 13:59:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:23,017 INFO L225 Difference]: With dead ends: 60 [2022-11-21 13:59:23,017 INFO L226 Difference]: Without dead ends: 58 [2022-11-21 13:59:23,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-11-21 13:59:23,019 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 56 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:23,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 105 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:59:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-21 13:59:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2022-11-21 13:59:23,026 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-21 13:59:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-21 13:59:23,028 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 20 [2022-11-21 13:59:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:23,028 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-21 13:59:23,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-21 13:59:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 13:59:23,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:23,030 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:23,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:23,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:23,236 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:23,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1995245389, now seen corresponding path program 2 times [2022-11-21 13:59:23,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:23,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360441787] [2022-11-21 13:59:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:23,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:23,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360441787] [2022-11-21 13:59:23,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360441787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:23,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816329793] [2022-11-21 13:59:23,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:59:23,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:23,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:23,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:23,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:59:23,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:59:23,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:23,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:59:23,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:23,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:23,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816329793] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:23,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:23,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-11-21 13:59:23,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140640988] [2022-11-21 13:59:23,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:23,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 13:59:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:23,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 13:59:23,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-21 13:59:23,601 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:23,732 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-11-21 13:59:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:59:23,733 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-21 13:59:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:23,734 INFO L225 Difference]: With dead ends: 85 [2022-11-21 13:59:23,734 INFO L226 Difference]: Without dead ends: 47 [2022-11-21 13:59:23,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:59:23,736 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:23,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 40 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:59:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-21 13:59:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-11-21 13:59:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-11-21 13:59:23,743 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2022-11-21 13:59:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:23,744 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-11-21 13:59:23,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-11-21 13:59:23,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 13:59:23,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:23,745 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:23,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-21 13:59:23,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:23,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1364521933, now seen corresponding path program 3 times [2022-11-21 13:59:23,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:23,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719460014] [2022-11-21 13:59:23,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:23,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:24,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:24,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719460014] [2022-11-21 13:59:24,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719460014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:24,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359267381] [2022-11-21 13:59:24,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:59:24,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:24,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:24,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:24,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:59:24,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-21 13:59:24,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:24,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-21 13:59:24,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:24,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 13:59:24,725 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 31 treesize of output 30 [2022-11-21 13:59:24,741 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 30 treesize of output 29 [2022-11-21 13:59:24,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 13:59:24,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:59:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:24,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:25,172 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 33 treesize of output 31 [2022-11-21 13:59:25,178 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 139 treesize of output 131 [2022-11-21 13:59:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:25,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359267381] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:25,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:25,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 23 [2022-11-21 13:59:25,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021320885] [2022-11-21 13:59:25,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:25,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-21 13:59:25,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:25,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 13:59:25,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-11-21 13:59:25,221 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 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-21 13:59:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:25,628 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-11-21 13:59:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 13:59:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 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 28 [2022-11-21 13:59:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:25,630 INFO L225 Difference]: With dead ends: 67 [2022-11-21 13:59:25,630 INFO L226 Difference]: Without dead ends: 65 [2022-11-21 13:59:25,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2022-11-21 13:59:25,631 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 143 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:25,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 98 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:59:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-21 13:59:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 29. [2022-11-21 13:59:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-11-21 13:59:25,638 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2022-11-21 13:59:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:25,638 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-11-21 13:59:25,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 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-21 13:59:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-11-21 13:59:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 13:59:25,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:25,640 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:25,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:25,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:25,840 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:25,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1191072622, now seen corresponding path program 4 times [2022-11-21 13:59:25,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:25,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585479738] [2022-11-21 13:59:25,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:25,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:26,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:26,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585479738] [2022-11-21 13:59:26,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585479738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:26,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543282200] [2022-11-21 13:59:26,211 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:59:26,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:26,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:26,215 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:26,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 13:59:26,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:59:26,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:26,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 13:59:26,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:26,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 13:59:26,636 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-21 13:59:26,636 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 10 [2022-11-21 13:59:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:26,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:26,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-21 13:59:26,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-21 13:59:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:27,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543282200] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:27,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:27,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-11-21 13:59:27,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384359342] [2022-11-21 13:59:27,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:27,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 13:59:27,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:27,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 13:59:27,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-11-21 13:59:27,041 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:28,378 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-11-21 13:59:28,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-21 13:59:28,379 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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-21 13:59:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:28,382 INFO L225 Difference]: With dead ends: 87 [2022-11-21 13:59:28,382 INFO L226 Difference]: Without dead ends: 68 [2022-11-21 13:59:28,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=416, Invalid=2340, Unknown=0, NotChecked=0, Total=2756 [2022-11-21 13:59:28,385 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 148 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:28,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 154 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 13:59:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-21 13:59:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 45. [2022-11-21 13:59:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-11-21 13:59:28,408 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 28 [2022-11-21 13:59:28,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:28,408 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-11-21 13:59:28,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-11-21 13:59:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 13:59:28,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:28,410 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:28,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:28,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:28,615 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:28,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash 367413348, now seen corresponding path program 5 times [2022-11-21 13:59:28,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:28,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488416789] [2022-11-21 13:59:28,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:28,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:29,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:29,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488416789] [2022-11-21 13:59:29,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488416789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:29,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301775827] [2022-11-21 13:59:29,142 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:59:29,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:29,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:29,144 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:29,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 13:59:29,256 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-21 13:59:29,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:29,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-21 13:59:29,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:29,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 13:59:29,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:29,433 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 26 treesize of output 25 [2022-11-21 13:59:29,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:29,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-21 13:59:29,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 13:59:29,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:59:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:29,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:30,040 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 31 treesize of output 29 [2022-11-21 13:59:30,046 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 137 treesize of output 129 [2022-11-21 13:59:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:30,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301775827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:30,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:30,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 29 [2022-11-21 13:59:30,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789870711] [2022-11-21 13:59:30,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:30,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-21 13:59:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:30,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-21 13:59:30,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2022-11-21 13:59:30,137 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:30,847 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-11-21 13:59:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-21 13:59:30,848 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-21 13:59:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:30,849 INFO L225 Difference]: With dead ends: 79 [2022-11-21 13:59:30,849 INFO L226 Difference]: Without dead ends: 77 [2022-11-21 13:59:30,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=353, Invalid=1903, Unknown=0, NotChecked=0, Total=2256 [2022-11-21 13:59:30,850 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 128 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:30,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 166 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:59:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-21 13:59:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 37. [2022-11-21 13:59:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-11-21 13:59:30,859 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2022-11-21 13:59:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:30,859 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-11-21 13:59:30,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-11-21 13:59:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 13:59:30,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:30,861 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:30,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-21 13:59:31,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-21 13:59:31,061 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:31,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 947747359, now seen corresponding path program 6 times [2022-11-21 13:59:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:31,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004178345] [2022-11-21 13:59:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:31,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004178345] [2022-11-21 13:59:31,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004178345] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:31,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358531678] [2022-11-21 13:59:31,481 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 13:59:31,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:31,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:31,483 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:31,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 13:59:31,584 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-21 13:59:31,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:31,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-21 13:59:31,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:31,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 13:59:32,184 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-21 13:59:32,185 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 10 [2022-11-21 13:59:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:32,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:32,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-21 13:59:32,720 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 34 treesize of output 28 [2022-11-21 13:59:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:32,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358531678] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:32,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:32,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 31 [2022-11-21 13:59:32,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015226703] [2022-11-21 13:59:32,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:32,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-21 13:59:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:32,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-21 13:59:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2022-11-21 13:59:32,884 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:34,707 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-11-21 13:59:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-21 13:59:34,708 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-21 13:59:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:34,709 INFO L225 Difference]: With dead ends: 103 [2022-11-21 13:59:34,709 INFO L226 Difference]: Without dead ends: 80 [2022-11-21 13:59:34,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=570, Invalid=3336, Unknown=0, NotChecked=0, Total=3906 [2022-11-21 13:59:34,711 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 219 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:34,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 155 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:59:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-21 13:59:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2022-11-21 13:59:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 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-21 13:59:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-11-21 13:59:34,740 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 36 [2022-11-21 13:59:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:34,741 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-11-21 13:59:34,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-11-21 13:59:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 13:59:34,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:34,743 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:34,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:34,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 13:59:34,949 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:34,950 INFO L85 PathProgramCache]: Analyzing trace with hash -470542059, now seen corresponding path program 7 times [2022-11-21 13:59:34,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:34,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779118660] [2022-11-21 13:59:34,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:34,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:35,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:35,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779118660] [2022-11-21 13:59:35,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779118660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:35,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880700695] [2022-11-21 13:59:35,711 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 13:59:35,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:35,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:35,715 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:35,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 13:59:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 13:59:35,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:35,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 13:59:35,979 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 31 treesize of output 30 [2022-11-21 13:59:35,999 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 30 treesize of output 29 [2022-11-21 13:59:36,071 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 30 treesize of output 29 [2022-11-21 13:59:36,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-21 13:59:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:36,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:36,659 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 32 treesize of output 30 [2022-11-21 13:59:36,663 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 546 treesize of output 530 [2022-11-21 13:59:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:37,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880700695] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:37,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:37,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 32 [2022-11-21 13:59:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737219772] [2022-11-21 13:59:37,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:37,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-21 13:59:37,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:37,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-21 13:59:37,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2022-11-21 13:59:37,170 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 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-21 13:59:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:37,903 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2022-11-21 13:59:37,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 13:59:37,904 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 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 44 [2022-11-21 13:59:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:37,904 INFO L225 Difference]: With dead ends: 91 [2022-11-21 13:59:37,905 INFO L226 Difference]: Without dead ends: 89 [2022-11-21 13:59:37,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=318, Invalid=1844, Unknown=0, NotChecked=0, Total=2162 [2022-11-21 13:59:37,906 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 150 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:37,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 205 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:59:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-21 13:59:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 45. [2022-11-21 13:59:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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-21 13:59:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-11-21 13:59:37,918 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2022-11-21 13:59:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:37,918 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-11-21 13:59:37,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 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-21 13:59:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-11-21 13:59:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 13:59:37,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:37,919 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:37,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:38,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-21 13:59:38,125 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:38,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1613367984, now seen corresponding path program 8 times [2022-11-21 13:59:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:38,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101242171] [2022-11-21 13:59:38,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:38,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:38,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101242171] [2022-11-21 13:59:38,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101242171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:38,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109587475] [2022-11-21 13:59:38,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:59:38,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:38,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:38,610 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:38,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 13:59:38,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:59:38,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:38,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-21 13:59:38,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:38,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:59:39,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:59:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:39,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:39,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-21 13:59:39,254 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 24 treesize of output 20 [2022-11-21 13:59:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:39,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109587475] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:39,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:39,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-11-21 13:59:39,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556930043] [2022-11-21 13:59:39,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:39,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-21 13:59:39,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:39,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 13:59:39,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2022-11-21 13:59:39,320 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:40,004 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-11-21 13:59:40,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-21 13:59:40,005 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 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-21 13:59:40,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:40,006 INFO L225 Difference]: With dead ends: 96 [2022-11-21 13:59:40,006 INFO L226 Difference]: Without dead ends: 94 [2022-11-21 13:59:40,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=1930, Unknown=0, NotChecked=0, Total=2162 [2022-11-21 13:59:40,007 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 101 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:40,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 256 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:59:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-21 13:59:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2022-11-21 13:59:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 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-21 13:59:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-11-21 13:59:40,024 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 44 [2022-11-21 13:59:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:40,025 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-11-21 13:59:40,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-11-21 13:59:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 13:59:40,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:40,026 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:40,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:40,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:40,236 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash 924773190, now seen corresponding path program 9 times [2022-11-21 13:59:40,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:40,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003953244] [2022-11-21 13:59:40,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:40,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:40,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:40,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003953244] [2022-11-21 13:59:40,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003953244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:40,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049749095] [2022-11-21 13:59:40,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:59:40,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:40,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:40,521 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:40,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 13:59:40,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-21 13:59:40,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:40,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 13:59:40,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:40,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:41,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049749095] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:41,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:41,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2022-11-21 13:59:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9290347] [2022-11-21 13:59:41,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:41,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 13:59:41,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:41,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 13:59:41,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-11-21 13:59:41,019 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 22 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:41,241 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2022-11-21 13:59:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:59:41,242 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 22 states have internal predecessors, (80), 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 48 [2022-11-21 13:59:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:41,243 INFO L225 Difference]: With dead ends: 114 [2022-11-21 13:59:41,243 INFO L226 Difference]: Without dead ends: 83 [2022-11-21 13:59:41,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2022-11-21 13:59:41,244 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 103 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:41,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 90 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:59:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-21 13:59:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2022-11-21 13:59:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-11-21 13:59:41,261 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 48 [2022-11-21 13:59:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:41,261 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-11-21 13:59:41,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 22 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-11-21 13:59:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-21 13:59:41,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:41,263 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:41,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:41,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:41,470 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:41,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash 730938950, now seen corresponding path program 10 times [2022-11-21 13:59:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:41,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77669214] [2022-11-21 13:59:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:42,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77669214] [2022-11-21 13:59:42,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77669214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:42,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936864380] [2022-11-21 13:59:42,154 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:59:42,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:42,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:42,156 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:42,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 13:59:42,383 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:59:42,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:42,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-21 13:59:42,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:42,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 13:59:42,524 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-21 13:59:42,524 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 26 treesize of output 25 [2022-11-21 13:59:42,542 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-21 13:59:42,542 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-21 13:59:42,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:42,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-21 13:59:42,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:42,914 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 28 treesize of output 10 [2022-11-21 13:59:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:42,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:43,274 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 38 treesize of output 36 [2022-11-21 13:59:43,278 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 71 treesize of output 67 [2022-11-21 13:59:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:43,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936864380] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:43,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:43,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 37 [2022-11-21 13:59:43,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229229592] [2022-11-21 13:59:43,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:43,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-21 13:59:43,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:43,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-21 13:59:43,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2022-11-21 13:59:43,495 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 37 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:44,480 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-11-21 13:59:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-21 13:59:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 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 52 [2022-11-21 13:59:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:44,481 INFO L225 Difference]: With dead ends: 101 [2022-11-21 13:59:44,482 INFO L226 Difference]: Without dead ends: 99 [2022-11-21 13:59:44,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=393, Invalid=2469, Unknown=0, NotChecked=0, Total=2862 [2022-11-21 13:59:44,483 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 203 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:44,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 245 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:59:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-21 13:59:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2022-11-21 13:59:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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-21 13:59:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-11-21 13:59:44,499 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2022-11-21 13:59:44,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:44,499 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-11-21 13:59:44,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-11-21 13:59:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 13:59:44,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:44,501 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:44,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:44,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 13:59:44,707 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:44,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:44,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1215546761, now seen corresponding path program 11 times [2022-11-21 13:59:44,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:44,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480494493] [2022-11-21 13:59:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 51 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:44,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:44,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480494493] [2022-11-21 13:59:44,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480494493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:44,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349065576] [2022-11-21 13:59:44,979 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:59:44,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:44,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:44,980 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:45,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 13:59:45,148 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-11-21 13:59:45,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:45,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:59:45,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 72 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:45,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 72 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:45,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349065576] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:45,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:45,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2022-11-21 13:59:45,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137846892] [2022-11-21 13:59:45,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:45,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 13:59:45,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:45,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 13:59:45,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2022-11-21 13:59:45,606 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 25 states, 25 states have (on average 3.68) internal successors, (92), 25 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:45,856 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-11-21 13:59:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 13:59:45,856 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.68) internal successors, (92), 25 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-21 13:59:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:45,857 INFO L225 Difference]: With dead ends: 100 [2022-11-21 13:59:45,857 INFO L226 Difference]: Without dead ends: 65 [2022-11-21 13:59:45,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 90 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2022-11-21 13:59:45,858 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 84 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:45,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 126 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:59:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-21 13:59:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2022-11-21 13:59:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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-21 13:59:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-11-21 13:59:45,881 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2022-11-21 13:59:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:45,881 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-11-21 13:59:45,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.68) internal successors, (92), 25 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-11-21 13:59:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-21 13:59:45,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:45,883 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:45,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-21 13:59:46,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 13:59:46,087 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash -836376270, now seen corresponding path program 12 times [2022-11-21 13:59:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:46,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687687152] [2022-11-21 13:59:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:46,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:46,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687687152] [2022-11-21 13:59:46,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687687152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:46,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242853021] [2022-11-21 13:59:46,775 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 13:59:46,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:46,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:46,776 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:46,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 13:59:47,086 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-11-21 13:59:47,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:47,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 13:59:47,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:47,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 13:59:47,419 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-21 13:59:47,419 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 27 treesize of output 34 [2022-11-21 13:59:48,677 INFO L321 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2022-11-21 13:59:48,677 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 34 treesize of output 13 [2022-11-21 13:59:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 62 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:48,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:54,499 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 26 treesize of output 24 [2022-11-21 13:59:54,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2022-11-21 13:59:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 39 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:54,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242853021] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:54,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:54,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 51 [2022-11-21 13:59:54,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578269650] [2022-11-21 13:59:54,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:54,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-21 13:59:54,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:54,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-21 13:59:54,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=2224, Unknown=1, NotChecked=0, Total=2550 [2022-11-21 13:59:54,720 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 51 states, 51 states have (on average 3.0392156862745097) internal successors, (155), 51 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:55,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:00:29,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 14:00:43,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 14:00:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:00:45,971 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2022-11-21 14:00:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-21 14:00:45,972 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.0392156862745097) internal successors, (155), 51 states have internal predecessors, (155), 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 60 [2022-11-21 14:00:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:00:45,972 INFO L225 Difference]: With dead ends: 137 [2022-11-21 14:00:45,972 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 14:00:45,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3918 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=1918, Invalid=13079, Unknown=9, NotChecked=0, Total=15006 [2022-11-21 14:00:45,976 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 565 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 247 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-21 14:00:45,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 223 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1253 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2022-11-21 14:00:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 14:00:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 14:00:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:00:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 14:00:45,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2022-11-21 14:00:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:00:45,978 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 14:00:45,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.0392156862745097) internal successors, (155), 51 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:00:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 14:00:45,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 14:00:45,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 14:00:45,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 14:00:46,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 14:00:46,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 14:05:32,780 WARN L233 SmtUtils]: Spent 4.78m on a formula simplification. DAG size of input: 383 DAG size of output: 382 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 14:06:10,903 WARN L233 SmtUtils]: Spent 37.26s on a formula simplification. DAG size of input: 382 DAG size of output: 185 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-21 14:06:12,206 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 37) no Hoare annotation was computed. [2022-11-21 14:06:12,206 INFO L899 garLoopResultBuilder]: For program point L19-1(lines 19 37) no Hoare annotation was computed. [2022-11-21 14:06:12,206 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 14:06:12,206 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 14:06:12,206 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 14:06:12,207 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-11-21 14:06:12,207 INFO L899 garLoopResultBuilder]: For program point L24-2(lines 24 31) no Hoare annotation was computed. [2022-11-21 14:06:12,207 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 31) the Hoare annotation is: (let ((.cse14 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse14))) (let ((.cse8 (forall ((v_ArrVal_528 Int) (|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select (store .cse4 .cse16 v_ArrVal_528) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~i~0#1| v_ArrVal_528)) (< |v_ULTIMATE.start_main_~i~0#1_216| 5) (< |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_216| 1))))) (.cse13 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse15 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)) (.cse7 (<= (+ (div (- |ULTIMATE.start_main_~a~0#1.offset|) 4) 4) |ULTIMATE.start_main_~i~0#1|)) (.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse9 (<= 5 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= ~SIZE~0 |ULTIMATE.start_main_~i~0#1|)) (.cse10 (<= 3 (select .cse4 12))) (.cse11 (<= 4 (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 16)))) (.cse2 (<= 1 (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (.cse3 (<= 2 |ULTIMATE.start_main_~i~0#1|)) (.cse12 (<= 5 (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 20)))) (.cse5 (<= 2 (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (.cse6 (= (select .cse4 0) 0))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0)) (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_main_~i~0#1_83| Int)) (and (not (< (+ |v_ULTIMATE.start_main_~i~0#1_83| 1) ~SIZE~0)) (<= |v_ULTIMATE.start_main_~i~0#1_83| 3) (<= |v_ULTIMATE.start_main_~i~0#1_83| (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4)))))) .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse1 .cse10 .cse11 .cse2 .cse3 .cse12 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse2 .cse3 (= 16 .cse14) .cse15 .cse5 .cse6) (and (or (and .cse0 .cse10 (= 5 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse11 .cse2 .cse3 .cse15 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse11 .cse2 .cse3 .cse15 .cse12 .cse5 .cse6)) .cse8) (and .cse0 .cse13 .cse2 .cse3 (<= .cse16 12) .cse15 .cse5 .cse6) (and (<= ~SIZE~0 2) .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse2 .cse6) (and .cse0 .cse2 .cse3 .cse15 (= 8 .cse14) .cse6) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse15 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse11 .cse2 .cse3 (<= ~SIZE~0 5) .cse5 .cse6) (and .cse7 .cse0 .cse9 .cse1 .cse10 .cse11 .cse2 (<= ~SIZE~0 6) .cse3 .cse12 .cse5 .cse6))))) [2022-11-21 14:06:12,207 INFO L899 garLoopResultBuilder]: For program point L24-4(lines 24 31) no Hoare annotation was computed. [2022-11-21 14:06:12,208 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-11-21 14:06:12,208 INFO L899 garLoopResultBuilder]: For program point L8-1(line 8) no Hoare annotation was computed. [2022-11-21 14:06:12,208 INFO L899 garLoopResultBuilder]: For program point L8-3(line 8) no Hoare annotation was computed. [2022-11-21 14:06:12,208 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 14:06:12,208 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 33 36) no Hoare annotation was computed. [2022-11-21 14:06:12,209 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 36) the Hoare annotation is: (let ((.cse30 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse9 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse30))) (let ((.cse37 (select .cse9 .cse26))) (let ((.cse36 (select .cse9 12)) (.cse38 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse17 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse18 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) (.cse19 (= (select .cse9 0) 0)) (.cse13 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse15 (<= 1 (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (.cse16 (= .cse37 0))) (let ((.cse0 (or (and .cse13 .cse17 .cse2 .cse18 .cse15 .cse19) (and .cse13 .cse14 .cse15 .cse16))) (.cse1 (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1)) (.cse34 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse31 (not (< .cse38 ~SIZE~0))) (.cse23 (<= (+ (div (- |ULTIMATE.start_main_~a~0#1.offset|) 4) 4) |ULTIMATE.start_main_~i~0#1|)) (.cse20 (<= 3 .cse36)) (.cse8 (<= |ULTIMATE.start_main_~i~0#1| 2)) (.cse35 (<= .cse38 .cse36)) (.cse5 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse10 (<= 4 (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| 16)))) (.cse21 (<= 2 |ULTIMATE.start_main_~i~0#1|)) (.cse39 (<= .cse26 12)) (.cse22 (<= |ULTIMATE.start_main_~i~0#1| .cse37)) (.cse4 (<= 2 (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))))) (let ((.cse6 (or (and .cse13 .cse17 .cse8 .cse18 .cse15 .cse21 .cse22 .cse19 .cse35) (and .cse13 .cse17 .cse5 .cse18 .cse10 .cse15 .cse21 .cse39 .cse22 .cse4 .cse19))) (.cse3 (exists ((|v_ULTIMATE.start_main_~i~0#1_83| Int)) (and (not (< (+ |v_ULTIMATE.start_main_~i~0#1_83| 1) ~SIZE~0)) (<= |v_ULTIMATE.start_main_~i~0#1_83| 3) (<= |v_ULTIMATE.start_main_~i~0#1_83| (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))))) (.cse12 (<= ~SIZE~0 2)) (.cse32 (or (and .cse13 .cse17 .cse5 .cse18 .cse15 .cse21 .cse39 .cse22 .cse4 .cse19) (and .cse23 .cse13 .cse17 (= |ULTIMATE.start_main_~i~0#1| 4) .cse20 .cse5 .cse18 .cse10 .cse15 .cse21 .cse4 .cse19))) (.cse33 (<= 4 |ULTIMATE.start_main_~i~0#1|)) (.cse24 (<= 5 |ULTIMATE.start_main_~i~0#1|)) (.cse27 (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= .cse38 |v_ULTIMATE.start_main_~i~0#1_216|)) (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse9 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) ~SIZE~0))))) (.cse28 (or (not (< |ULTIMATE.start_main_~i~0#1| ~SIZE~0)) (< |ULTIMATE.start_main_~i~0#1| (+ .cse37 1)))) (.cse29 (or (< |ULTIMATE.start_main_~i~0#1| (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse30 4))) .cse31)) (.cse7 (<= ~SIZE~0 5)) (.cse25 (or (and .cse14 .cse0 .cse20 .cse4) (and .cse0 .cse1 .cse2 .cse10 (<= .cse34 .cse36) .cse4))) (.cse11 (<= 5 (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| 20))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse8 (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse9 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_216| (+ 3 |ULTIMATE.start_main_~i~0#1|)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) ~SIZE~0)))) .cse10 .cse6 .cse11) (and .cse12 .cse13 .cse14 .cse15 .cse16) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (and (not (< (+ |v_ULTIMATE.start_main_~i~0#1_55| 1) ~SIZE~0)) (<= |v_ULTIMATE.start_main_~i~0#1_55| (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_55| 4)))) (<= |v_ULTIMATE.start_main_~i~0#1_55| 2))) .cse13 .cse17 .cse2 .cse18 .cse15 .cse19) (and .cse14 .cse0 .cse20 .cse10 .cse7 .cse4) (and .cse13 .cse17 .cse1 .cse8 .cse18 .cse15 .cse21 .cse22 .cse3 .cse19) (and .cse14 .cse0 (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= |ULTIMATE.start_main_~i~0#1| 3) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)) (<= |ULTIMATE.start_main_~i~0#1| (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) .cse4) (and .cse23 .cse13 .cse17 .cse24 .cse20 .cse5 .cse18 .cse15 .cse21 .cse7 .cse4 .cse19) (and .cse25 .cse17 .cse7) (and .cse13 .cse17 .cse1 .cse5 .cse18 .cse15 .cse21 .cse3 .cse4 .cse19) (and .cse23 .cse13 .cse17 (forall ((v_ArrVal_528 Int) (|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select (store .cse9 .cse26 v_ArrVal_528) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~i~0#1| v_ArrVal_528)) (< |v_ULTIMATE.start_main_~i~0#1_216| 5) (< |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_216| 1)))) .cse1 .cse24 .cse20 .cse5 .cse18 .cse10 .cse15 .cse21 .cse27 .cse11 .cse28 .cse4 .cse19 .cse29) (and .cse13 .cse17 .cse18 .cse15 .cse21 (= 8 .cse30) .cse31 .cse4 .cse19) (and .cse12 .cse13 .cse17 .cse18 .cse21 .cse19) (and .cse32 .cse27 .cse11 .cse33) (and .cse23 .cse13 .cse17 .cse24 .cse20 .cse5 .cse18 .cse10 .cse15 (<= ~SIZE~0 6) .cse21 .cse11 .cse4 .cse19 (<= 6 |ULTIMATE.start_main_~i~0#1|)) (and .cse32 (= 3 |ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse9 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_216| .cse34) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) ~SIZE~0)))) .cse10 .cse11) (and .cse32 .cse7 .cse33) (and .cse23 .cse13 .cse17 .cse24 .cse20 .cse5 .cse18 .cse10 .cse15 .cse21 .cse27 .cse11 (= .cse30 24) .cse28 .cse4 .cse19 .cse29) (and .cse13 .cse17 .cse8 .cse18 .cse10 .cse15 .cse21 .cse7 .cse22 .cse19 .cse35) (and .cse25 (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse9 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_216| 5) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) ~SIZE~0)))) .cse10 .cse11)))))))) [2022-11-21 14:06:12,209 INFO L902 garLoopResultBuilder]: At program point L38(lines 16 39) the Hoare annotation is: true [2022-11-21 14:06:12,209 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 29) no Hoare annotation was computed. [2022-11-21 14:06:12,210 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 29) no Hoare annotation was computed. [2022-11-21 14:06:12,213 INFO L444 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1, 1] [2022-11-21 14:06:12,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 14:06:12,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,238 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,238 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,239 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,239 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,239 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,239 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,259 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,271 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,271 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,273 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,273 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,273 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,273 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,274 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,274 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,274 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,274 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,280 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,280 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,280 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,281 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,281 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,281 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,282 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,282 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,282 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,283 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,283 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,283 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,284 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,284 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,284 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,285 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,285 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,285 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,285 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,286 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,286 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,287 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,287 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,287 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,287 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,288 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,288 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,288 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,289 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,289 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,289 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,289 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,290 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,290 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,290 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,291 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,291 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,291 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,292 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,292 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,292 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,292 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,293 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,294 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,294 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,295 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,295 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,295 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,302 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,303 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,303 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,303 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,304 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,304 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,304 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,304 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,305 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,305 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,305 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,306 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,306 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,306 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,307 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,307 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,307 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,307 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,308 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,308 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,308 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,310 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,310 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,310 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 02:06:12 BoogieIcfgContainer [2022-11-21 14:06:12,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 14:06:12,323 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 14:06:12,323 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 14:06:12,323 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 14:06:12,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:59:18" (3/4) ... [2022-11-21 14:06:12,327 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 14:06:12,336 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-21 14:06:12,337 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-21 14:06:12,337 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 14:06:12,337 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 14:06:12,360 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a == 0 && i == 0) && 2 <= SIZE) || ((((((a == 0 && SIZE <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((-a / 4 + 4 <= i && a == 0) && (forall v_ArrVal_528 : int, v_ULTIMATE.start_main_~i~0#1_216 : int :: ((v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][a + i * 4 := v_ArrVal_528][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || !(i <= v_ArrVal_528)) || v_ULTIMATE.start_main_~i~0#1_216 < 5) || i < v_ULTIMATE.start_main_~i~0#1_216 + 1)) && 5 <= i) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 16 == i * 4) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 5 == i) && 3 <= i) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && (forall v_ArrVal_528 : int, v_ULTIMATE.start_main_~i~0#1_216 : int :: ((v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][a + i * 4 := v_ArrVal_528][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || !(i <= v_ArrVal_528)) || v_ULTIMATE.start_main_~i~0#1_216 < 5) || i < v_ULTIMATE.start_main_~i~0#1_216 + 1))) || (((((((a == 0 && 3 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((SIZE <= 2 && a == 0) && 1 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((a == 0 && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 8 == i * 4) && unknown-#memory_int-unknown[a][0] == 0)) || (((a == 0 && i == 1) && i + 1 <= SIZE) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((-a / 4 + 4 <= i && a == 0) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((-a / 4 + 4 <= i && a == 0) && 5 <= i) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && SIZE <= 6) && 2 <= i) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) [2022-11-21 14:06:12,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8]) || ((3 <= i && (((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12]) || ((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0))) && SIZE <= 5)) || ((((i <= 2 && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 3 + i) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && (((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12]) || ((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0))) && 5 <= unknown-#memory_int-unknown[a][a + 20])) || ((((SIZE <= 2 && a == 0) && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) || (((((((\exists v_ULTIMATE.start_main_~i~0#1_55 : int :: (!(v_ULTIMATE.start_main_~i~0#1_55 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_55 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_55 * 4]) && v_ULTIMATE.start_main_~i~0#1_55 <= 2) && a == 0) && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8])) || (((((((((a == 0 && 1 <= i) && cond == 1) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && unknown-#memory_int-unknown[a][0] == 0)) || (((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && (\exists ULTIMATE.start_main_~i~0#1 : int :: (ULTIMATE.start_main_~i~0#1 <= 3 && !(ULTIMATE.start_main_~i~0#1 + 1 < SIZE)) && ULTIMATE.start_main_~i~0#1 <= unknown-#memory_int-unknown[a][a + ULTIMATE.start_main_~i~0#1 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8])) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) || (((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 2 + i <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8])) && 1 <= i) && SIZE <= 5)) || (((((((((a == 0 && 1 <= i) && cond == 1) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && (forall v_ArrVal_528 : int, v_ULTIMATE.start_main_~i~0#1_216 : int :: ((v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][a + i * 4 := v_ArrVal_528][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || !(i <= v_ArrVal_528)) || v_ULTIMATE.start_main_~i~0#1_216 < 5) || i < v_ULTIMATE.start_main_~i~0#1_216 + 1)) && cond == 1) && 5 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (!(i + 1 <= v_ULTIMATE.start_main_~i~0#1_216) || v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4]) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && (!(i < SIZE) || i < unknown-#memory_int-unknown[a][a + i * 4] + 1)) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) && (i < unknown-#memory_int-unknown[a][a + i * 4 + 4] || !(i + 1 < SIZE)))) || ((((((((a == 0 && 1 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 8 == i * 4) && !(i + 1 < SIZE)) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((SIZE <= 2 && a == 0) && 1 <= i) && !(cond == 0)) && 2 <= i) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && i == 4) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (!(i + 1 <= v_ULTIMATE.start_main_~i~0#1_216) || v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4]) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 4 <= i)) || ((((((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && SIZE <= 6) && 2 <= i) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) && 6 <= i)) || ((((((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && i == 4) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && 3 == i) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 2 + i) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 5 <= unknown-#memory_int-unknown[a][a + 20])) || ((((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && i == 4) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && SIZE <= 5) && 4 <= i)) || ((((((((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (!(i + 1 <= v_ULTIMATE.start_main_~i~0#1_216) || v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4]) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && i * 4 == 24) && (!(i < SIZE) || i < unknown-#memory_int-unknown[a][a + i * 4] + 1)) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) && (i < unknown-#memory_int-unknown[a][a + i * 4 + 4] || !(i + 1 < SIZE)))) || ((((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12])) || (((((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) || (((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 2 + i <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8])) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 5) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 5 <= unknown-#memory_int-unknown[a][a + 20]) [2022-11-21 14:06:12,367 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 14:06:12,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 14:06:12,368 INFO L158 Benchmark]: Toolchain (without parser) took 414756.01ms. Allocated memory was 146.8MB in the beginning and 373.3MB in the end (delta: 226.5MB). Free memory was 115.7MB in the beginning and 167.4MB in the end (delta: -51.7MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. [2022-11-21 14:06:12,368 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 146.8MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 14:06:12,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.19ms. Allocated memory is still 146.8MB. Free memory was 115.3MB in the beginning and 105.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-21 14:06:12,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.93ms. Allocated memory is still 146.8MB. Free memory was 105.2MB in the beginning and 103.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 14:06:12,369 INFO L158 Benchmark]: Boogie Preprocessor took 26.44ms. Allocated memory is still 146.8MB. Free memory was 103.7MB in the beginning and 102.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 14:06:12,369 INFO L158 Benchmark]: RCFGBuilder took 426.72ms. Allocated memory is still 146.8MB. Free memory was 102.4MB in the beginning and 91.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 14:06:12,369 INFO L158 Benchmark]: TraceAbstraction took 413886.39ms. Allocated memory was 146.8MB in the beginning and 373.3MB in the end (delta: 226.5MB). Free memory was 91.1MB in the beginning and 170.5MB in the end (delta: -79.4MB). Peak memory consumption was 201.2MB. Max. memory is 16.1GB. [2022-11-21 14:06:12,370 INFO L158 Benchmark]: Witness Printer took 44.19ms. Allocated memory is still 373.3MB. Free memory was 170.5MB in the beginning and 167.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 14:06:12,371 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 146.8MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.19ms. Allocated memory is still 146.8MB. Free memory was 115.3MB in the beginning and 105.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.93ms. Allocated memory is still 146.8MB. Free memory was 105.2MB in the beginning and 103.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.44ms. Allocated memory is still 146.8MB. Free memory was 103.7MB in the beginning and 102.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 426.72ms. Allocated memory is still 146.8MB. Free memory was 102.4MB in the beginning and 91.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 413886.39ms. Allocated memory was 146.8MB in the beginning and 373.3MB in the end (delta: 226.5MB). Free memory was 91.1MB in the beginning and 170.5MB in the end (delta: -79.4MB). Peak memory consumption was 201.2MB. Max. memory is 16.1GB. * Witness Printer took 44.19ms. Allocated memory is still 373.3MB. Free memory was 170.5MB in the beginning and 167.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 413.7s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 59.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 326.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 2031 SdHoareTripleChecker+Valid, 11.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2031 mSDsluCounter, 1962 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1722 mSDsCounter, 865 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6129 IncrementalHoareTripleChecker+Invalid, 6997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 865 mSolverCounterUnsat, 240 mSDtfsCounter, 6129 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1414 GetRequests, 767 SyntacticMatches, 72 SemanticMatches, 575 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9650 ImplicationChecksByTransitivity, 58.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=12, InterpolantAutomatonStates: 409, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 317 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 69 NumberOfFragments, 2926 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1453 FormulaSimplificationTreeSizeReduction, 287.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 37292050 FormulaSimplificationTreeSizeReductionInter, 38.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1484 ConstructedInterpolants, 136 QuantifiedInterpolants, 14243 SizeOfPredicates, 123 NumberOfNonLiveVariables, 1925 ConjunctsInSsa, 336 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 483/2583 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant [2022-11-21 14:06:12,391 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] Derived loop invariant: (((((((((((a == 0 && i == 0) && 2 <= SIZE) || ((((((a == 0 && SIZE <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((-a / 4 + 4 <= i && a == 0) && (forall v_ArrVal_528 : int, v_ULTIMATE.start_main_~i~0#1_216 : int :: ((v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][a + i * 4 := v_ArrVal_528][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || !(i <= v_ArrVal_528)) || v_ULTIMATE.start_main_~i~0#1_216 < 5) || i < v_ULTIMATE.start_main_~i~0#1_216 + 1)) && 5 <= i) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 16 == i * 4) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 5 == i) && 3 <= i) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && (forall v_ArrVal_528 : int, v_ULTIMATE.start_main_~i~0#1_216 : int :: ((v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][a + i * 4 := v_ArrVal_528][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || !(i <= v_ArrVal_528)) || v_ULTIMATE.start_main_~i~0#1_216 < 5) || i < v_ULTIMATE.start_main_~i~0#1_216 + 1))) || (((((((a == 0 && 3 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((SIZE <= 2 && a == 0) && 1 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((a == 0 && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 8 == i * 4) && unknown-#memory_int-unknown[a][0] == 0)) || (((a == 0 && i == 1) && i + 1 <= SIZE) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((-a / 4 + 4 <= i && a == 0) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((-a / 4 + 4 <= i && a == 0) && 5 <= i) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && SIZE <= 6) && 2 <= i) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) - InvariantResult [Line: 33]: Loop Invariant [2022-11-21 14:06:12,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-21 14:06:12,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-21 14:06:12,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-21 14:06:12,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-21 14:06:12,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,428 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,428 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,428 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,428 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,429 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,429 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,429 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,429 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,429 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,430 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,430 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,430 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,431 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-21 14:06:12,431 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8]) || ((3 <= i && (((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12]) || ((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0))) && SIZE <= 5)) || ((((i <= 2 && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 3 + i) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && (((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12]) || ((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0))) && 5 <= unknown-#memory_int-unknown[a][a + 20])) || ((((SIZE <= 2 && a == 0) && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) || (((((((\exists v_ULTIMATE.start_main_~i~0#1_55 : int :: (!(v_ULTIMATE.start_main_~i~0#1_55 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_55 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_55 * 4]) && v_ULTIMATE.start_main_~i~0#1_55 <= 2) && a == 0) && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8])) || (((((((((a == 0 && 1 <= i) && cond == 1) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && unknown-#memory_int-unknown[a][0] == 0)) || (((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && (\exists ULTIMATE.start_main_~i~0#1 : int :: (ULTIMATE.start_main_~i~0#1 <= 3 && !(ULTIMATE.start_main_~i~0#1 + 1 < SIZE)) && ULTIMATE.start_main_~i~0#1 <= unknown-#memory_int-unknown[a][a + ULTIMATE.start_main_~i~0#1 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8])) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) || (((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 2 + i <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8])) && 1 <= i) && SIZE <= 5)) || (((((((((a == 0 && 1 <= i) && cond == 1) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && (forall v_ArrVal_528 : int, v_ULTIMATE.start_main_~i~0#1_216 : int :: ((v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][a + i * 4 := v_ArrVal_528][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || !(i <= v_ArrVal_528)) || v_ULTIMATE.start_main_~i~0#1_216 < 5) || i < v_ULTIMATE.start_main_~i~0#1_216 + 1)) && cond == 1) && 5 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (!(i + 1 <= v_ULTIMATE.start_main_~i~0#1_216) || v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4]) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && (!(i < SIZE) || i < unknown-#memory_int-unknown[a][a + i * 4] + 1)) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) && (i < unknown-#memory_int-unknown[a][a + i * 4 + 4] || !(i + 1 < SIZE)))) || ((((((((a == 0 && 1 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 8 == i * 4) && !(i + 1 < SIZE)) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((SIZE <= 2 && a == 0) && 1 <= i) && !(cond == 0)) && 2 <= i) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && i == 4) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (!(i + 1 <= v_ULTIMATE.start_main_~i~0#1_216) || v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4]) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 4 <= i)) || ((((((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && SIZE <= 6) && 2 <= i) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) && 6 <= i)) || ((((((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && i == 4) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && 3 == i) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 2 + i) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 5 <= unknown-#memory_int-unknown[a][a + 20])) || ((((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && i == 4) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && SIZE <= 5) && 4 <= i)) || ((((((((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (!(i + 1 <= v_ULTIMATE.start_main_~i~0#1_216) || v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4]) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && i * 4 == 24) && (!(i < SIZE) || i < unknown-#memory_int-unknown[a][a + i * 4] + 1)) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) && (i < unknown-#memory_int-unknown[a][a + i * 4 + 4] || !(i + 1 < SIZE)))) || ((((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12])) || (((((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) || (((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 2 + i <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8])) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 5) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 5 <= unknown-#memory_int-unknown[a][a + 20]) RESULT: Ultimate proved your program to be correct! [2022-11-21 14:06:12,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6b1265-dcda-406a-b03b-3d6c4eb5a5a0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE