./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/prefixsum_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/prefixsum_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 11:11:15,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:11:15,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:11:15,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:11:15,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:11:15,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:11:15,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:11:15,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:11:15,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:11:15,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:11:15,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:11:15,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:11:15,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:11:15,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:11:15,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:11:15,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:11:15,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:11:15,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:11:15,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:11:15,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:11:15,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:11:15,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:11:15,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:11:15,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:11:15,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:11:15,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:11:15,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:11:15,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:11:15,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:11:15,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:11:15,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:11:15,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:11:15,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:11:15,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:11:15,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:11:15,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:11:15,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:11:15,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:11:15,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:11:15,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:11:15,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:11:15,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 11:11:15,267 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:11:15,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:11:15,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:11:15,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:11:15,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:11:15,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:11:15,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:11:15,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:11:15,276 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:11:15,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:11:15,276 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:11:15,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:11:15,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:11:15,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:11:15,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:11:15,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:11:15,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:11:15,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:11:15,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:11:15,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:11:15,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:11:15,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:11:15,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:11:15,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:11:15,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:11:15,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:11:15,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:11:15,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:11:15,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:11:15,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:11:15,280 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:11:15,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 11:11:15,280 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:11:15,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:11:15,281 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:11:15,281 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d [2022-12-13 11:11:15,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:11:15,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:11:15,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:11:15,513 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:11:15,513 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:11:15,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-12-13 11:11:18,046 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:11:18,208 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:11:18,208 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-12-13 11:11:18,212 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/data/fd3296b5f/def775dcfe6640159d55e4bdc993cd05/FLAG9a69a3d40 [2022-12-13 11:11:18,223 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/data/fd3296b5f/def775dcfe6640159d55e4bdc993cd05 [2022-12-13 11:11:18,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:11:18,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:11:18,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:11:18,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:11:18,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:11:18,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71120c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18, skipping insertion in model container [2022-12-13 11:11:18,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:11:18,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:11:18,368 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_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2022-12-13 11:11:18,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:11:18,404 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:11:18,414 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_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2022-12-13 11:11:18,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:11:18,439 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:11:18,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18 WrapperNode [2022-12-13 11:11:18,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:11:18,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:11:18,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:11:18,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:11:18,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,474 INFO L138 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2022-12-13 11:11:18,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:11:18,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:11:18,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:11:18,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:11:18,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,499 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:11:18,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:11:18,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:11:18,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:11:18,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (1/1) ... [2022-12-13 11:11:18,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:11:18,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:11:18,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:11:18,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:11:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:11:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 11:11:18,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 11:11:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:11:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:11:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 11:11:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:11:18,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:11:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:11:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-13 11:11:18,565 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-13 11:11:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:11:18,636 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:11:18,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:11:18,803 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:11:18,807 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:11:18,808 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-12-13 11:11:18,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:11:18 BoogieIcfgContainer [2022-12-13 11:11:18,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:11:18,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:11:18,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:11:18,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:11:18,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:11:18" (1/3) ... [2022-12-13 11:11:18,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d76a438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:11:18, skipping insertion in model container [2022-12-13 11:11:18,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:18" (2/3) ... [2022-12-13 11:11:18,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d76a438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:11:18, skipping insertion in model container [2022-12-13 11:11:18,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:11:18" (3/3) ... [2022-12-13 11:11:18,816 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2022-12-13 11:11:18,829 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:11:18,829 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:11:18,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:11:18,867 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;@78013965, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:11:18,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 11:11:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 11:11:18,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 11:11:18,876 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:18,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:18,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:11:18,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash -750888739, now seen corresponding path program 1 times [2022-12-13 11:11:18,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:18,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579932691] [2022-12-13 11:11:18,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:11:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:11:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:11:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 11:11:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:19,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579932691] [2022-12-13 11:11:19,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579932691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:19,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:19,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:11:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914825716] [2022-12-13 11:11:19,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:19,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:11:19,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:19,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:11:19,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:11:19,092 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 11:11:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:19,142 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2022-12-13 11:11:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:11:19,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-12-13 11:11:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:19,149 INFO L225 Difference]: With dead ends: 81 [2022-12-13 11:11:19,150 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 11:11:19,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-12-13 11:11:19,154 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:19,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:11:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 11:11:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-12-13 11:11:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 11:11:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-12-13 11:11:19,182 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-12-13 11:11:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:19,183 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-12-13 11:11:19,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 11:11:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-12-13 11:11:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 11:11:19,184 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:19,184 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:19,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:11:19,185 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:11:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 221792227, now seen corresponding path program 1 times [2022-12-13 11:11:19,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:19,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263082770] [2022-12-13 11:11:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:11:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:11:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:11:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 11:11:19,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:19,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263082770] [2022-12-13 11:11:19,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263082770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:19,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:19,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:11:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058229814] [2022-12-13 11:11:19,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:19,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:11:19,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:19,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:11:19,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:11:19,460 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:19,647 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2022-12-13 11:11:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:11:19,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-12-13 11:11:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:19,649 INFO L225 Difference]: With dead ends: 97 [2022-12-13 11:11:19,649 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 11:11:19,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:11:19,651 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 73 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:19,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 256 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:11:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 11:11:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2022-12-13 11:11:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 11:11:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-12-13 11:11:19,659 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 37 [2022-12-13 11:11:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:19,660 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-12-13 11:11:19,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-12-13 11:11:19,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 11:11:19,661 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:19,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:19,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:11:19,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:11:19,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash 747513669, now seen corresponding path program 1 times [2022-12-13 11:11:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:19,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013110232] [2022-12-13 11:11:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:11:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:11:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:11:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 11:11:20,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:20,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013110232] [2022-12-13 11:11:20,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013110232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:20,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049581509] [2022-12-13 11:11:20,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:20,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:20,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:11:20,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:11:20,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 11:11:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 11:11:20,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:20,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:11:20,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-13 11:11:20,494 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:11:20,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:11:20,507 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_45 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_45))) is different from true [2022-12-13 11:11:20,518 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 13 treesize of output 15 [2022-12-13 11:11:20,536 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 13 treesize of output 15 [2022-12-13 11:11:20,565 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 0 case distinctions, treesize of input 23 treesize of output 18 [2022-12-13 11:11:20,621 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 39 treesize of output 33 [2022-12-13 11:11:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-12-13 11:11:20,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:48,822 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_46 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2022-12-13 11:11:50,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049581509] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:50,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:11:50,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 21 [2022-12-13 11:11:50,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961306049] [2022-12-13 11:11:50,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:50,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 11:11:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:50,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 11:11:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=430, Unknown=19, NotChecked=86, Total=600 [2022-12-13 11:11:50,879 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 21 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 11:11:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:51,291 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-12-13 11:11:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:11:51,292 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 39 [2022-12-13 11:11:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:51,293 INFO L225 Difference]: With dead ends: 46 [2022-12-13 11:11:51,293 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 11:11:51,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=223, Invalid=1098, Unknown=19, NotChecked=142, Total=1482 [2022-12-13 11:11:51,295 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:51,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 228 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 268 Invalid, 0 Unknown, 45 Unchecked, 0.2s Time] [2022-12-13 11:11:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 11:11:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-12-13 11:11:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 11:11:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-12-13 11:11:51,310 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 39 [2022-12-13 11:11:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:51,310 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-12-13 11:11:51,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 11:11:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-12-13 11:11:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 11:11:51,311 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:51,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:51,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 11:11:51,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:51,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:11:51,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1715230204, now seen corresponding path program 1 times [2022-12-13 11:11:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:51,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433718468] [2022-12-13 11:11:51,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:11:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:51,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:51,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:11:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:11:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 11:11:51,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:51,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433718468] [2022-12-13 11:11:51,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433718468] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:51,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622567413] [2022-12-13 11:11:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:51,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:51,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:11:51,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:11:51,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 11:11:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:51,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 11:11:51,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 11:11:51,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 11:11:51,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622567413] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:51,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:51,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-12-13 11:11:51,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942534125] [2022-12-13 11:11:51,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:51,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:11:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:51,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:11:51,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:11:51,912 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:52,120 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2022-12-13 11:11:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:11:52,121 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-12-13 11:11:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:52,122 INFO L225 Difference]: With dead ends: 113 [2022-12-13 11:11:52,122 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 11:11:52,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-12-13 11:11:52,124 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 120 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:52,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 267 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:11:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 11:11:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 43. [2022-12-13 11:11:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 11:11:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-12-13 11:11:52,131 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 43 [2022-12-13 11:11:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:52,131 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-12-13 11:11:52,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-12-13 11:11:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 11:11:52,132 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:52,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:52,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 11:11:52,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:52,333 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:11:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:52,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1080974370, now seen corresponding path program 2 times [2022-12-13 11:11:52,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:52,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080398995] [2022-12-13 11:11:52,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:11:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:52,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:52,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:11:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:11:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 11:11:52,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:52,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080398995] [2022-12-13 11:11:52,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080398995] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:52,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023488714] [2022-12-13 11:11:52,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:11:52,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:52,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:11:52,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:11:52,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 11:11:52,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:11:52,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:11:52,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 11:11:52,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:11:52,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:11:52,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023488714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:52,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:11:52,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-12-13 11:11:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260246418] [2022-12-13 11:11:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:52,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:52,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:52,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:11:52,706 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:52,787 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-12-13 11:11:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:11:52,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-12-13 11:11:52,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:52,788 INFO L225 Difference]: With dead ends: 63 [2022-12-13 11:11:52,788 INFO L226 Difference]: Without dead ends: 46 [2022-12-13 11:11:52,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:11:52,789 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:52,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:11:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-12-13 11:11:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-12-13 11:11:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 11:11:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-12-13 11:11:52,796 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 45 [2022-12-13 11:11:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:52,796 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-12-13 11:11:52,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-12-13 11:11:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 11:11:52,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:52,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:52,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 11:11:52,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:52,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:11:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1924122647, now seen corresponding path program 1 times [2022-12-13 11:11:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:52,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812527352] [2022-12-13 11:11:52,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:52,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:11:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:11:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:11:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 11:11:53,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:53,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812527352] [2022-12-13 11:11:53,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812527352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:53,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:53,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:11:53,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875152133] [2022-12-13 11:11:53,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:53,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:11:53,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:53,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:11:53,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:11:53,053 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:53,081 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-12-13 11:11:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:11:53,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-12-13 11:11:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:53,083 INFO L225 Difference]: With dead ends: 62 [2022-12-13 11:11:53,083 INFO L226 Difference]: Without dead ends: 45 [2022-12-13 11:11:53,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:11:53,084 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:53,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:11:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-13 11:11:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-12-13 11:11:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 11:11:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-12-13 11:11:53,093 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 48 [2022-12-13 11:11:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:53,093 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-12-13 11:11:53,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-12-13 11:11:53,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 11:11:53,094 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:53,094 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:53,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:11:53,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:11:53,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1397539149, now seen corresponding path program 1 times [2022-12-13 11:11:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:53,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790628254] [2022-12-13 11:11:53,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:11:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:11:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:11:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:11:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790628254] [2022-12-13 11:11:53,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790628254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14108882] [2022-12-13 11:11:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:53,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:53,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:11:53,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:11:53,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 11:11:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 11:11:53,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 11:11:53,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:11:53,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14108882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:53,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:11:53,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2022-12-13 11:11:53,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607944981] [2022-12-13 11:11:53,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:53,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:53,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:53,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:53,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:11:53,390 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:53,436 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-12-13 11:11:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:11:53,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-12-13 11:11:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:53,437 INFO L225 Difference]: With dead ends: 58 [2022-12-13 11:11:53,437 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 11:11:53,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:11:53,438 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:53,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:11:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 11:11:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-12-13 11:11:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 11:11:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-12-13 11:11:53,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 49 [2022-12-13 11:11:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:53,448 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-12-13 11:11:53,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-12-13 11:11:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 11:11:53,449 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:53,450 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:53,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 11:11:53,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 11:11:53,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:11:53,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1418623757, now seen corresponding path program 1 times [2022-12-13 11:11:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:53,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173264849] [2022-12-13 11:11:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:11:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:11:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:11:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:11:53,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:53,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173264849] [2022-12-13 11:11:53,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173264849] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:53,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095858377] [2022-12-13 11:11:53,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:53,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:53,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:11:53,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:11:53,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 11:11:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:53,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 11:11:53,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:11:53,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:11:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:11:54,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095858377] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:11:54,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:11:54,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 14 [2022-12-13 11:11:54,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366266278] [2022-12-13 11:11:54,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:11:54,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:11:54,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:54,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:11:54,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:11:54,074 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:54,393 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2022-12-13 11:11:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:11:54,393 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-12-13 11:11:54,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:54,394 INFO L225 Difference]: With dead ends: 96 [2022-12-13 11:11:54,394 INFO L226 Difference]: Without dead ends: 87 [2022-12-13 11:11:54,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2022-12-13 11:11:54,396 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 96 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:54,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 318 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:11:54,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-13 11:11:54,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2022-12-13 11:11:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 11:11:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-12-13 11:11:54,407 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 52 [2022-12-13 11:11:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:54,407 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-12-13 11:11:54,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:11:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-12-13 11:11:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 11:11:54,408 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:54,408 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:54,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 11:11:54,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:54,609 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:11:54,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash -282483074, now seen corresponding path program 1 times [2022-12-13 11:11:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:54,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834066603] [2022-12-13 11:11:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:54,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:11:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:11:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:11:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 11:11:54,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:54,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834066603] [2022-12-13 11:11:54,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834066603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:11:54,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918956987] [2022-12-13 11:11:54,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:54,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:11:54,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:11:54,955 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:11:54,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 11:11:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:55,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 111 conjunts are in the unsatisfiable core [2022-12-13 11:11:55,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:11:55,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:11:55,055 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 7 treesize of output 6 [2022-12-13 11:11:55,105 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:11:55,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:11:55,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:11:55,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-12-13 11:11:55,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-12-13 11:11:55,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2022-12-13 11:11:55,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2022-12-13 11:11:55,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2022-12-13 11:11:56,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-12-13 11:11:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 11:11:56,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:37,324 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (let ((.cse3 (+ (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse2 (store (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|))) (store .cse4 .cse5 (+ (select .cse4 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|)) (select .cse4 .cse5)))) (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (store .cse2 .cse1 (+ (select .cse2 .cse1) (select .cse2 .cse3)))) .cse3 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_check_~a0#1.offset|)))) (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)))) is different from false [2022-12-13 11:13:57,955 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~n~0#1| Int)) (or (forall ((|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse7))))))) (let ((.cse0 (let ((.cse4 (+ (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse3 (store (let ((.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|))))) (+ (- 4) (* |ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (store .cse3 .cse1 (+ (select .cse3 .cse1) (select .cse3 .cse4)))) .cse4 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_check_~a0#1.offset|)))))) (< (+ |c_ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~n~0#1|) (not (< |c_ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~n~0#1|)))) is different from false [2022-12-13 11:14:00,010 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|ULTIMATE.start_main_~n~0#1| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| 4 .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse7))))))) (let ((.cse0 (let ((.cse4 (+ (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse3 (store (let ((.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|))))) (+ (- 4) (* |ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (store .cse3 .cse1 (+ (select .cse3 .cse1) (select .cse3 .cse4)))) .cse4 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_check_~a0#1.offset|)))) (not (< (+ |c_ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~n~0#1|)) (< (+ |c_ULTIMATE.start_main_~i~1#1| 2) |ULTIMATE.start_main_~n~0#1|) (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)))) is different from false [2022-12-13 11:14:02,091 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|ULTIMATE.start_main_~n~0#1| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (not (< (+ |c_ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~n~0#1|)) (< (+ |c_ULTIMATE.start_main_~i~1#1| 2) |ULTIMATE.start_main_~n~0#1|) (let ((.cse1 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (let ((.cse8 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse8) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse8))))) (store .cse7 (+ |ULTIMATE.start_main_~a0~0#1.offset| 4 .cse8) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4 .cse8)))))))) (let ((.cse0 (let ((.cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4)))) (store (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|)) (select .cse5 .cse6)))) (+ |ULTIMATE.start_main_~a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~n~0#1| 4)) 0))) (store .cse3 .cse1 (+ (select .cse3 .cse4) (select .cse3 .cse1)))) .cse4 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_check_~a0#1.offset|)))) (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)))) is different from false [2022-12-13 11:14:04,170 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_main_~n~0#1| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (< 2 |ULTIMATE.start_main_~n~0#1|) (let ((.cse1 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base|) |ULTIMATE.start_main_~a0~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)))) (store .cse7 (+ |ULTIMATE.start_main_~a0~0#1.offset| 4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (let ((.cse0 (let ((.cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4)))) (store (let ((.cse3 (store (let ((.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|))))) (+ |ULTIMATE.start_main_~a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~n~0#1| 4)) 0))) (store .cse3 .cse1 (+ (select .cse3 .cse1) (select .cse3 .cse4)))) .cse4 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |ULTIMATE.start_check_~a0#1.offset|))))) (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)) (not (< 1 |ULTIMATE.start_main_~n~0#1|)))) is different from false [2022-12-13 11:14:06,259 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_222 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_main_~n~0#1| Int) (|v_ULTIMATE.start_downsweep_~left~1#1_6| Int)) (or (let ((.cse1 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (let ((.cse7 (let ((.cse8 ((as const (Array Int Int)) 0))) (store .cse8 |ULTIMATE.start_main_~a0~0#1.offset| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse7 (+ |ULTIMATE.start_main_~a0~0#1.offset| 4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (let ((.cse0 (let ((.cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_downsweep_~left~1#1_6| 4)))) (store (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|)) (select .cse5 .cse6)))) (+ |ULTIMATE.start_main_~a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~n~0#1| 4)) 0))) (store .cse3 .cse1 (+ (select .cse3 .cse1) (select .cse3 .cse4)))) .cse4 v_ArrVal_222)))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |ULTIMATE.start_check_~a0#1.offset|))))) (< 2 |ULTIMATE.start_main_~n~0#1|) (not (<= |v_ULTIMATE.start_downsweep_~left~1#1_6| 0)) (not (< 1 |ULTIMATE.start_main_~n~0#1|)))) is different from false [2022-12-13 11:14:06,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918956987] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:06,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:14:06,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 27] total 34 [2022-12-13 11:14:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091210272] [2022-12-13 11:14:06,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:06,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 11:14:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 11:14:06,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2035, Unknown=47, NotChecked=582, Total=2862 [2022-12-13 11:14:06,270 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 34 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 11:14:09,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:14:14,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:14:14,687 INFO L93 Difference]: Finished difference Result 187 states and 229 transitions. [2022-12-13 11:14:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-13 11:14:14,688 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2022-12-13 11:14:14,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:14:14,689 INFO L225 Difference]: With dead ends: 187 [2022-12-13 11:14:14,689 INFO L226 Difference]: Without dead ends: 164 [2022-12-13 11:14:14,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 134.2s TimeCoverageRelationStatistics Valid=1206, Invalid=7701, Unknown=47, NotChecked=1146, Total=10100 [2022-12-13 11:14:14,691 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 525 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 106 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:14:14,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 472 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1226 Invalid, 3 Unknown, 0 Unchecked, 4.4s Time] [2022-12-13 11:14:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-13 11:14:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 83. [2022-12-13 11:14:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 73 states have internal predecessors, (88), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 11:14:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2022-12-13 11:14:14,720 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 53 [2022-12-13 11:14:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:14:14,720 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2022-12-13 11:14:14,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.34375) internal successors, (75), 30 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 11:14:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-12-13 11:14:14,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 11:14:14,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:14:14,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:14,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 11:14:14,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:14,923 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:14:14,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1645706784, now seen corresponding path program 2 times [2022-12-13 11:14:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:14,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928613756] [2022-12-13 11:14:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:14,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:15,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:14:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:15,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:14:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:15,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:14:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:15,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:14:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:14:15,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:15,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928613756] [2022-12-13 11:14:15,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928613756] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:15,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426929420] [2022-12-13 11:14:15,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:14:15,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:15,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:14:15,126 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:14:15,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 11:14:15,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:14:15,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:14:15,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 11:14:15,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:14:15,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:14:15,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426929420] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:15,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:15,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-12-13 11:14:15,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462286054] [2022-12-13 11:14:15,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:15,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 11:14:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:15,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 11:14:15,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:14:15,368 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:14:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:14:15,866 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2022-12-13 11:14:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 11:14:15,866 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-12-13 11:14:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:14:15,867 INFO L225 Difference]: With dead ends: 145 [2022-12-13 11:14:15,868 INFO L226 Difference]: Without dead ends: 124 [2022-12-13 11:14:15,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2022-12-13 11:14:15,869 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 184 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:14:15,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 367 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:14:15,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-12-13 11:14:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2022-12-13 11:14:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 74 states have internal predecessors, (89), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 11:14:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2022-12-13 11:14:15,887 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 55 [2022-12-13 11:14:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:14:15,887 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2022-12-13 11:14:15,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:14:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-12-13 11:14:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 11:14:15,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:14:15,888 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:15,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 11:14:16,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:16,089 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:14:16,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:16,090 INFO L85 PathProgramCache]: Analyzing trace with hash 576449656, now seen corresponding path program 3 times [2022-12-13 11:14:16,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:16,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80502949] [2022-12-13 11:14:16,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:16,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:14:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:16,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:14:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:16,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:14:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:16,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:14:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 11:14:16,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:16,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80502949] [2022-12-13 11:14:16,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80502949] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:16,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348660149] [2022-12-13 11:14:16,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 11:14:16,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:14:16,264 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:14:16,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 11:14:16,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 11:14:16,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:14:16,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 11:14:16,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 11:14:16,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 11:14:17,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348660149] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:17,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:17,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2022-12-13 11:14:17,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077919448] [2022-12-13 11:14:17,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:17,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 11:14:17,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:17,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 11:14:17,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2022-12-13 11:14:17,007 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 30 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 29 states have internal predecessors, (103), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 11:14:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:14:18,148 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2022-12-13 11:14:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:14:18,148 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 29 states have internal predecessors, (103), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 56 [2022-12-13 11:14:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:14:18,149 INFO L225 Difference]: With dead ends: 151 [2022-12-13 11:14:18,149 INFO L226 Difference]: Without dead ends: 134 [2022-12-13 11:14:18,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=397, Invalid=2053, Unknown=0, NotChecked=0, Total=2450 [2022-12-13 11:14:18,150 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 198 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:14:18,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 605 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:14:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-12-13 11:14:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 101. [2022-12-13 11:14:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 91 states have internal predecessors, (110), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 11:14:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2022-12-13 11:14:18,173 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 56 [2022-12-13 11:14:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:14:18,173 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2022-12-13 11:14:18,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 29 states have internal predecessors, (103), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 11:14:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-12-13 11:14:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 11:14:18,174 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:14:18,174 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:18,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 11:14:18,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:18,376 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:14:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:18,377 INFO L85 PathProgramCache]: Analyzing trace with hash 116417284, now seen corresponding path program 1 times [2022-12-13 11:14:18,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:18,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70784519] [2022-12-13 11:14:18,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:18,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:14:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:14:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:18,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:14:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:14:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 11:14:18,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:18,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70784519] [2022-12-13 11:14:18,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70784519] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:18,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787578718] [2022-12-13 11:14:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:18,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:18,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:14:18,557 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:14:18,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 11:14:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:18,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 11:14:18,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 11:14:18,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 11:14:18,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787578718] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:18,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:18,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2022-12-13 11:14:18,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837341133] [2022-12-13 11:14:18,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:18,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:14:18,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:18,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:14:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:14:18,813 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:14:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:14:19,107 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2022-12-13 11:14:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:14:19,108 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2022-12-13 11:14:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:14:19,109 INFO L225 Difference]: With dead ends: 139 [2022-12-13 11:14:19,109 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 11:14:19,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-12-13 11:14:19,110 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 72 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:14:19,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 419 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:14:19,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 11:14:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 82. [2022-12-13 11:14:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 72 states have internal predecessors, (85), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 11:14:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-12-13 11:14:19,130 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 58 [2022-12-13 11:14:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:14:19,130 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-12-13 11:14:19,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:14:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-12-13 11:14:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 11:14:19,131 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:14:19,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:19,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 11:14:19,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 11:14:19,332 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:14:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash -4426440, now seen corresponding path program 2 times [2022-12-13 11:14:19,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:19,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983301669] [2022-12-13 11:14:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:19,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:19,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:14:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:19,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:14:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:19,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:14:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:19,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:14:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 11:14:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:19,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983301669] [2022-12-13 11:14:19,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983301669] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:19,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269244394] [2022-12-13 11:14:19,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:14:19,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:14:19,464 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:14:19,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 11:14:19,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:14:19,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:14:19,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 11:14:19,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 11:14:19,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 11:14:19,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269244394] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:19,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:19,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 11 [2022-12-13 11:14:19,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448242674] [2022-12-13 11:14:19,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:19,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:14:19,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:19,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:14:19,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:14:19,706 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:14:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:14:19,858 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2022-12-13 11:14:19,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:14:19,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2022-12-13 11:14:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:14:19,859 INFO L225 Difference]: With dead ends: 105 [2022-12-13 11:14:19,859 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 11:14:19,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 120 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:14:19,860 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:14:19,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 220 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:14:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 11:14:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-12-13 11:14:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 74 states have internal predecessors, (88), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 11:14:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2022-12-13 11:14:19,881 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 61 [2022-12-13 11:14:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:14:19,881 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2022-12-13 11:14:19,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:14:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-12-13 11:14:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 11:14:19,882 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:14:19,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:19,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 11:14:20,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 11:14:20,083 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:14:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:20,083 INFO L85 PathProgramCache]: Analyzing trace with hash 108996138, now seen corresponding path program 3 times [2022-12-13 11:14:20,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:20,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181883450] [2022-12-13 11:14:20,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:20,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:20,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:14:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:20,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:14:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:20,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:14:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:14:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 11:14:20,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:20,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181883450] [2022-12-13 11:14:20,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181883450] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:20,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577569015] [2022-12-13 11:14:20,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 11:14:20,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:20,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:14:20,295 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:14:20,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 11:14:20,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 11:14:20,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:14:20,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 147 conjunts are in the unsatisfiable core [2022-12-13 11:14:20,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:20,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:14:20,690 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 7 treesize of output 6 [2022-12-13 11:14:20,751 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:14:20,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:14:20,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:14:20,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-12-13 11:14:20,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-12-13 11:14:20,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-13 11:14:31,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2022-12-13 11:14:31,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2022-12-13 11:14:31,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-12-13 11:14:32,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-12-13 11:14:32,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2022-12-13 11:14:36,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 160 [2022-12-13 11:14:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:14:36,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:16:35,746 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 Int) (|v_ULTIMATE.start_downsweep_~n#1_13| Int) (|aux_mod_ULTIMATE.start_downsweep_~space#1_43| Int) (v_ArrVal_450 Int) (|aux_div_ULTIMATE.start_downsweep_~space#1_43| Int) (v_ArrVal_449 Int) (v_ArrVal_447 Int) (|v_ULTIMATE.start_main_~i~1#1_42| Int) (v_ArrVal_457 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_447) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_42| 4)) v_ArrVal_449))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (let ((.cse3 (store (store (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 v_ArrVal_450) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_454) (+ (* |v_ULTIMATE.start_downsweep_~n#1_13| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_457)) (.cse4 (+ (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 8) (* 16 |aux_div_ULTIMATE.start_downsweep_~space#1_43|)))) (let ((.cse5 (+ (* |aux_div_ULTIMATE.start_downsweep_~space#1_43| 8) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 4))) (.cse6 (select .cse3 .cse4))) (store (store .cse3 .cse4 (+ (select .cse3 .cse5) .cse6)) .cse5 .cse6))))) (or (>= |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< 0 |aux_div_ULTIMATE.start_downsweep_~space#1_43|) (not (< (+ (* |aux_div_ULTIMATE.start_downsweep_~space#1_43| 4) (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 2)) (+ |v_ULTIMATE.start_downsweep_~n#1_13| 1))) (= (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~1#1_42| 2) (not (< 0 (+ |aux_mod_ULTIMATE.start_downsweep_~space#1_43| (* 2 |aux_div_ULTIMATE.start_downsweep_~space#1_43|)))))))) is different from false [2022-12-13 11:16:37,838 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~1#1| 1) |v_ULTIMATE.start_main_~i~1#1_43|)) (forall ((v_ArrVal_454 Int) (|v_ULTIMATE.start_downsweep_~n#1_13| Int) (|aux_mod_ULTIMATE.start_downsweep_~space#1_43| Int) (v_ArrVal_450 Int) (|aux_div_ULTIMATE.start_downsweep_~space#1_43| Int) (v_ArrVal_449 Int) (v_ArrVal_447 Int) (|v_ULTIMATE.start_main_~i~1#1_42| Int) (v_ArrVal_457 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |c_ULTIMATE.start_main_~a0~0#1.offset|) v_ArrVal_447) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_42| 4)) v_ArrVal_449))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2 v_ArrVal_450) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_454) (+ (* |v_ULTIMATE.start_downsweep_~n#1_13| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_457)) (.cse4 (+ (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 8) (* 16 |aux_div_ULTIMATE.start_downsweep_~space#1_43|)))) (let ((.cse5 (+ (* |aux_div_ULTIMATE.start_downsweep_~space#1_43| 8) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 4))) (.cse6 (select .cse3 .cse4))) (store (store .cse3 .cse4 (+ (select .cse3 .cse5) .cse6)) .cse5 .cse6))))) (or (>= |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 2) (< 0 |aux_div_ULTIMATE.start_downsweep_~space#1_43|) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse1 .cse2)) (not (< (+ (* |aux_div_ULTIMATE.start_downsweep_~space#1_43| 4) (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 2)) (+ |v_ULTIMATE.start_downsweep_~n#1_13| 1))) (not (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< |v_ULTIMATE.start_main_~i~1#1_42| 2) (not (< 0 (+ |aux_mod_ULTIMATE.start_downsweep_~space#1_43| (* 2 |aux_div_ULTIMATE.start_downsweep_~space#1_43|)))))))))) is different from false [2022-12-13 11:16:40,021 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 Int) (|v_ULTIMATE.start_downsweep_~n#1_13| Int) (|aux_mod_ULTIMATE.start_downsweep_~space#1_43| Int) (v_ArrVal_450 Int) (|aux_div_ULTIMATE.start_downsweep_~space#1_43| Int) (v_ArrVal_449 Int) (|v_ULTIMATE.start_main_~i~1#1_43| Int) (v_ArrVal_447 Int) (|v_ULTIMATE.start_main_~i~1#1_42| Int) (v_ArrVal_457 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (let ((.cse7 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |c_ULTIMATE.start_main_~a0~0#1.offset|) v_ArrVal_447) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_42| 4)) v_ArrVal_449))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (let ((.cse3 (store (store (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2 v_ArrVal_450) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_454) (+ (* |v_ULTIMATE.start_downsweep_~n#1_13| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_457)) (.cse4 (+ (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 8) (* 16 |aux_div_ULTIMATE.start_downsweep_~space#1_43|)))) (let ((.cse6 (+ (* |aux_div_ULTIMATE.start_downsweep_~space#1_43| 8) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 4))) (.cse5 (select .cse3 .cse4))) (store (store .cse3 .cse4 (+ .cse5 (select .cse3 .cse6))) .cse6 .cse5))))) (or (>= |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 2) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< 0 |aux_div_ULTIMATE.start_downsweep_~space#1_43|) (not (<= (+ |c_ULTIMATE.start_main_~i~1#1| 1) |v_ULTIMATE.start_main_~i~1#1_43|)) (not (< (+ (* |aux_div_ULTIMATE.start_downsweep_~space#1_43| 4) (* |aux_mod_ULTIMATE.start_downsweep_~space#1_43| 2)) (+ |v_ULTIMATE.start_downsweep_~n#1_13| 1))) (< |v_ULTIMATE.start_main_~i~1#1_42| 2) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) (select .cse0 .cse2)) (not (< 0 (+ |aux_mod_ULTIMATE.start_downsweep_~space#1_43| (* 2 |aux_div_ULTIMATE.start_downsweep_~space#1_43|)))))))) is different from false [2022-12-13 11:16:43,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577569015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:16:43,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:16:43,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 38] total 45 [2022-12-13 11:16:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448070599] [2022-12-13 11:16:43,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:16:43,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 11:16:43,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:16:43,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 11:16:43,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=4385, Unknown=40, NotChecked=408, Total=5112 [2022-12-13 11:16:43,974 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 45 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 11:16:48,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:16:55,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:17:03,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:17:26,573 WARN L233 SmtUtils]: Spent 9.42s on a formula simplification. DAG size of input: 94 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:17:37,727 WARN L233 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 100 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:17:46,592 WARN L233 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 94 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:17:58,196 WARN L233 SmtUtils]: Spent 10.12s on a formula simplification. DAG size of input: 91 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:18:06,731 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 97 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:18:14,225 WARN L233 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 103 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:18:19,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:18:28,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:18:29,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:18:30,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:18:39,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:18:55,044 WARN L233 SmtUtils]: Spent 9.80s on a formula simplification. DAG size of input: 138 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:19:06,264 WARN L233 SmtUtils]: Spent 9.27s on a formula simplification. DAG size of input: 135 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:19:15,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:19:27,053 WARN L233 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 85 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:19:28,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:19:37,525 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 122 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:19:39,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:19:51,145 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 132 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:19:59,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:20:09,430 WARN L233 SmtUtils]: Spent 7.96s on a formula simplification. DAG size of input: 158 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:20:22,481 WARN L233 SmtUtils]: Spent 9.63s on a formula simplification. DAG size of input: 135 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:20:24,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:20:34,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:20:36,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:20:46,952 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 161 DAG size of output: 155 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:20:54,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:07,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:08,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:10,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:12,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:26,506 WARN L233 SmtUtils]: Spent 9.82s on a formula simplification. DAG size of input: 168 DAG size of output: 155 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:21:33,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:36,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:38,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:48,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:48,431 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2022-12-13 11:21:48,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-13 11:21:48,434 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-12-13 11:21:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:48,434 INFO L225 Difference]: With dead ends: 169 [2022-12-13 11:21:48,434 INFO L226 Difference]: Without dead ends: 139 [2022-12-13 11:21:48,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 130 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2949 ImplicationChecksByTransitivity, 390.5s TimeCoverageRelationStatistics Valid=2201, Invalid=14267, Unknown=56, NotChecked=768, Total=17292 [2022-12-13 11:21:48,437 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 838 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 200 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:48,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 491 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2373 Invalid, 26 Unknown, 0 Unchecked, 54.8s Time] [2022-12-13 11:21:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-13 11:21:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 90. [2022-12-13 11:21:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 11:21:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-12-13 11:21:48,466 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 64 [2022-12-13 11:21:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:48,466 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-12-13 11:21:48,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 11:21:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-12-13 11:21:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 11:21:48,467 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:48,467 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:48,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 11:21:48,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 11:21:48,668 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:21:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1177879933, now seen corresponding path program 4 times [2022-12-13 11:21:48,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:48,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813453725] [2022-12-13 11:21:48,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:48,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:21:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:21:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:48,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:21:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:48,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:21:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 11:21:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813453725] [2022-12-13 11:21:48,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813453725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008500317] [2022-12-13 11:21:48,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 11:21:48,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:48,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:48,905 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:48,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 11:21:49,052 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 11:21:49,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:21:49,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 11:21:49,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 11:21:49,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 11:21:49,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008500317] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:21:49,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:21:49,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 19 [2022-12-13 11:21:49,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542155195] [2022-12-13 11:21:49,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:49,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 11:21:49,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 11:21:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:21:49,288 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:21:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:49,908 INFO L93 Difference]: Finished difference Result 194 states and 237 transitions. [2022-12-13 11:21:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:21:49,908 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 70 [2022-12-13 11:21:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:49,909 INFO L225 Difference]: With dead ends: 194 [2022-12-13 11:21:49,909 INFO L226 Difference]: Without dead ends: 181 [2022-12-13 11:21:49,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 133 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1048, Unknown=0, NotChecked=0, Total=1406 [2022-12-13 11:21:49,910 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 120 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:49,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 476 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:21:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-12-13 11:21:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 122. [2022-12-13 11:21:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 11:21:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2022-12-13 11:21:49,989 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 70 [2022-12-13 11:21:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:49,990 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2022-12-13 11:21:49,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:21:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2022-12-13 11:21:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 11:21:49,990 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:49,991 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:49,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 11:21:50,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 11:21:50,192 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:21:50,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1338998268, now seen corresponding path program 5 times [2022-12-13 11:21:50,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:50,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612007730] [2022-12-13 11:21:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:50,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:50,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:21:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:50,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:21:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:50,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:21:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:50,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:21:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 11:21:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:50,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612007730] [2022-12-13 11:21:50,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612007730] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:50,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335248411] [2022-12-13 11:21:50,616 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 11:21:50,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:50,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:50,617 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:50,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 11:21:51,468 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-13 11:21:51,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:21:51,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 11:21:51,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 11:21:51,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:21:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 11:21:51,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335248411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:21:51,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:21:51,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2022-12-13 11:21:51,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634398838] [2022-12-13 11:21:51,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:21:51,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 11:21:51,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:51,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 11:21:51,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2022-12-13 11:21:51,947 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 36 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 35 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:21:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:21:54,299 INFO L93 Difference]: Finished difference Result 233 states and 288 transitions. [2022-12-13 11:21:54,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 11:21:54,299 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 35 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 71 [2022-12-13 11:21:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:21:54,300 INFO L225 Difference]: With dead ends: 233 [2022-12-13 11:21:54,300 INFO L226 Difference]: Without dead ends: 199 [2022-12-13 11:21:54,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=885, Invalid=4815, Unknown=0, NotChecked=0, Total=5700 [2022-12-13 11:21:54,301 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 556 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:21:54,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 937 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 11:21:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-12-13 11:21:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 142. [2022-12-13 11:21:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.2272727272727273) internal successors, (162), 132 states have internal predecessors, (162), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 11:21:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2022-12-13 11:21:54,370 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 71 [2022-12-13 11:21:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:21:54,370 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2022-12-13 11:21:54,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 35 states have internal predecessors, (93), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:21:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2022-12-13 11:21:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 11:21:54,371 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:21:54,371 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:54,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 11:21:54,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:54,571 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:21:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1370992095, now seen corresponding path program 6 times [2022-12-13 11:21:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:54,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447074374] [2022-12-13 11:21:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:55,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:21:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:21:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:21:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:21:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 11:21:55,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:55,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447074374] [2022-12-13 11:21:55,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447074374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:21:55,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643537703] [2022-12-13 11:21:55,090 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 11:21:55,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:21:55,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:55,091 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:21:55,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 11:21:55,329 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-13 11:21:55,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:21:55,333 WARN L261 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 185 conjunts are in the unsatisfiable core [2022-12-13 11:21:55,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:21:55,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:21:55,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-13 11:21:55,552 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:21:55,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:21:55,583 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_638 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_638) |c_#memory_int|)) is different from true [2022-12-13 11:21:55,588 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 13 treesize of output 15 [2022-12-13 11:21:55,624 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 13 treesize of output 15 [2022-12-13 11:21:55,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-13 11:21:55,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 11:21:55,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-12-13 11:21:55,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-12-13 11:21:55,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2022-12-13 11:21:55,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:21:55,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 66 [2022-12-13 11:21:56,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 90 [2022-12-13 11:21:56,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 101 [2022-12-13 11:21:56,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2022-12-13 11:21:57,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2022-12-13 11:21:57,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 134 [2022-12-13 11:21:58,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 238 [2022-12-13 11:21:58,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 549 treesize of output 541 [2022-12-13 11:22:01,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 796 treesize of output 776 [2022-12-13 11:22:01,229 INFO L321 Elim1Store]: treesize reduction 28, result has 9.7 percent of original size [2022-12-13 11:22:01,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2837 treesize of output 2812 [2022-12-13 11:22:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-12-13 11:22:01,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:22:44,587 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a0~0#1.offset| Int) (|ULTIMATE.start_main_~i~1#1| Int)) (or (< 1 |ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_653 Int) (v_ArrVal_651 Int) (v_ArrVal_662 Int) (|v_ULTIMATE.start_downsweep_~space#1_39| Int) (|v_ULTIMATE.start_downsweep_~n#1_16| Int) (v_ArrVal_657 Int)) (or (not (< 0 |v_ULTIMATE.start_downsweep_~space#1_39|)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (let ((.cse13 (* |ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ .cse13 |ULTIMATE.start_main_~a0~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse12 (+ .cse13 |ULTIMATE.start_main_~a0~0#1.offset| 8) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (let ((.cse1 (let ((.cse3 (let ((.cse7 (+ (- 4) (* |v_ULTIMATE.start_downsweep_~space#1_39| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse5 (let ((.cse9 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (store (store (let ((.cse11 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse11 .cse2 (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse11 .cse2)))) .cse9 v_ArrVal_651) (+ (* |v_ULTIMATE.start_downsweep_~n#1_16| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_653))) (let ((.cse10 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ .cse10 (select .cse8 .cse2))) .cse2 .cse10))))) (.cse6 (+ (- 4) (* 8 |v_ULTIMATE.start_downsweep_~space#1_39|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse7) (select .cse5 .cse6)))) .cse7 v_ArrVal_657))) (.cse4 (+ (* 16 |v_ULTIMATE.start_downsweep_~space#1_39|) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse3 .cse4 v_ArrVal_662) (+ (- 4) (* 12 |v_ULTIMATE.start_downsweep_~space#1_39|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 .cse4))))) (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4)) (select .cse1 .cse2)) (select .cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (< 2 (* 2 |v_ULTIMATE.start_downsweep_~space#1_39|)) (< (+ 3 |ULTIMATE.start_main_~i~1#1|) |v_ULTIMATE.start_downsweep_~n#1_16|) (not (< 3 |v_ULTIMATE.start_downsweep_~n#1_16|)))))) is different from false [2022-12-13 11:22:44,899 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 Int) (v_ArrVal_651 Int) (v_ArrVal_662 Int) (|v_ULTIMATE.start_downsweep_~space#1_39| Int) (v_ArrVal_639 (Array Int Int)) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|v_ULTIMATE.start_downsweep_~n#1_16| Int) (v_ArrVal_657 Int) (|ULTIMATE.start_main_~i~1#1| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (let ((.cse13 (* |ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse12 (store v_ArrVal_639 (+ .cse13 |ULTIMATE.start_main_~a0~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse12 (+ .cse13 |ULTIMATE.start_main_~a0~0#1.offset| 8) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (let ((.cse0 (let ((.cse3 (let ((.cse7 (+ (- 4) (* |v_ULTIMATE.start_downsweep_~space#1_39| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse5 (let ((.cse9 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (store (store (let ((.cse11 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse11 .cse1 (+ (select .cse11 .cse1) (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))) .cse9 v_ArrVal_651) (+ (* |v_ULTIMATE.start_downsweep_~n#1_16| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_653))) (let ((.cse10 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse1) .cse10)) .cse1 .cse10))))) (.cse6 (+ (- 4) (* 8 |v_ULTIMATE.start_downsweep_~space#1_39|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse7) (select .cse5 .cse6)))) .cse7 v_ArrVal_657))) (.cse4 (+ (* 16 |v_ULTIMATE.start_downsweep_~space#1_39|) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse3 .cse4 v_ArrVal_662) (+ (- 4) (* 12 |v_ULTIMATE.start_downsweep_~space#1_39|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 .cse4))))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4)))))) (not (< 0 |v_ULTIMATE.start_downsweep_~space#1_39|)) (< 2 (* 2 |v_ULTIMATE.start_downsweep_~space#1_39|)) (< 1 |ULTIMATE.start_main_~i~1#1|) (< (+ 3 |ULTIMATE.start_main_~i~1#1|) |v_ULTIMATE.start_downsweep_~n#1_16|) (not (< 3 |v_ULTIMATE.start_downsweep_~n#1_16|)))) is different from false [2022-12-13 11:22:45,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 Int) (v_ArrVal_651 Int) (v_ArrVal_662 Int) (|v_ULTIMATE.start_downsweep_~space#1_39| Int) (v_ArrVal_639 (Array Int Int)) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|v_ULTIMATE.start_downsweep_~n#1_16| Int) (v_ArrVal_657 Int) (|ULTIMATE.start_main_~i~1#1| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (let ((.cse13 (* |ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse12 (store v_ArrVal_639 (+ .cse13 |ULTIMATE.start_main_~a0~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse12 (+ .cse13 |ULTIMATE.start_main_~a0~0#1.offset| 8) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (let ((.cse0 (let ((.cse3 (let ((.cse7 (+ (- 4) (* |v_ULTIMATE.start_downsweep_~space#1_39| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse6 (+ (- 4) (* 8 |v_ULTIMATE.start_downsweep_~space#1_39|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (let ((.cse9 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (store (store (let ((.cse11 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse11 .cse2 (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse11 .cse2)))) .cse9 v_ArrVal_651) (+ (* |v_ULTIMATE.start_downsweep_~n#1_16| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_653))) (let ((.cse10 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ .cse10 (select .cse8 .cse2))) .cse2 .cse10)))))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 .cse7)))) .cse7 v_ArrVal_657))) (.cse4 (+ (* 16 |v_ULTIMATE.start_downsweep_~space#1_39|) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse3 .cse4 v_ArrVal_662) (+ (- 4) (* 12 |v_ULTIMATE.start_downsweep_~space#1_39|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 .cse4))))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_#t~malloc16#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4)) (select .cse0 .cse2))))) (not (< 0 |v_ULTIMATE.start_downsweep_~space#1_39|)) (< 2 (* 2 |v_ULTIMATE.start_downsweep_~space#1_39|)) (< 1 |ULTIMATE.start_main_~i~1#1|) (< (+ 3 |ULTIMATE.start_main_~i~1#1|) |v_ULTIMATE.start_downsweep_~n#1_16|) (not (< 3 |v_ULTIMATE.start_downsweep_~n#1_16|)))) is different from false [2022-12-13 11:22:45,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643537703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:45,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:22:45,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 45] total 55 [2022-12-13 11:22:45,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602186340] [2022-12-13 11:22:45,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:22:45,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-13 11:22:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:45,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-13 11:22:45,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=6590, Unknown=16, NotChecked=668, Total=7656 [2022-12-13 11:22:45,304 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 52 states have internal predecessors, (102), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 11:24:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:24:03,704 INFO L93 Difference]: Finished difference Result 335 states and 408 transitions. [2022-12-13 11:24:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-12-13 11:24:03,705 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 52 states have internal predecessors, (102), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 72 [2022-12-13 11:24:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:24:03,705 INFO L225 Difference]: With dead ends: 335 [2022-12-13 11:24:03,706 INFO L226 Difference]: Without dead ends: 284 [2022-12-13 11:24:03,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 7242 ImplicationChecksByTransitivity, 114.9s TimeCoverageRelationStatistics Valid=4364, Invalid=30414, Unknown=20, NotChecked=1492, Total=36290 [2022-12-13 11:24:03,711 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1024 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 4181 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 4586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 4181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:24:03,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 808 Invalid, 4586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 4181 Invalid, 0 Unknown, 182 Unchecked, 8.7s Time] [2022-12-13 11:24:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-12-13 11:24:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 158. [2022-12-13 11:24:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 145 states have (on average 1.2137931034482758) internal successors, (176), 145 states have internal predecessors, (176), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 11:24:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 196 transitions. [2022-12-13 11:24:03,806 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 196 transitions. Word has length 72 [2022-12-13 11:24:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:24:03,806 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 196 transitions. [2022-12-13 11:24:03,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 52 states have internal predecessors, (102), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 11:24:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-12-13 11:24:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 11:24:03,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:24:03,807 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:24:03,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 11:24:04,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:24:04,009 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:24:04,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:24:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1937220788, now seen corresponding path program 4 times [2022-12-13 11:24:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:24:04,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073245237] [2022-12-13 11:24:04,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:24:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:24:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:24:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:24:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:04,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:24:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 11:24:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 11:24:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:24:04,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073245237] [2022-12-13 11:24:04,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073245237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:24:04,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802660312] [2022-12-13 11:24:04,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 11:24:04,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:24:04,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:24:04,346 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:24:04,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 11:24:04,432 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 11:24:04,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:24:04,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 11:24:04,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:24:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 11:24:04,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:24:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 30 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 11:24:04,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802660312] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:24:04,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:24:04,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 30 [2022-12-13 11:24:04,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798453923] [2022-12-13 11:24:04,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:24:04,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 11:24:04,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:24:04,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 11:24:04,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2022-12-13 11:24:04,789 INFO L87 Difference]: Start difference. First operand 158 states and 196 transitions. Second operand has 30 states, 30 states have (on average 3.0) internal successors, (90), 29 states have internal predecessors, (90), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:24:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:24:07,928 INFO L93 Difference]: Finished difference Result 517 states and 635 transitions. [2022-12-13 11:24:07,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-13 11:24:07,929 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.0) internal successors, (90), 29 states have internal predecessors, (90), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2022-12-13 11:24:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:24:07,930 INFO L225 Difference]: With dead ends: 517 [2022-12-13 11:24:07,930 INFO L226 Difference]: Without dead ends: 430 [2022-12-13 11:24:07,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1394, Invalid=6978, Unknown=0, NotChecked=0, Total=8372 [2022-12-13 11:24:07,931 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 970 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:24:07,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 750 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 11:24:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-12-13 11:24:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 165. [2022-12-13 11:24:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 152 states have (on average 1.1973684210526316) internal successors, (182), 152 states have internal predecessors, (182), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 11:24:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2022-12-13 11:24:08,038 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 75 [2022-12-13 11:24:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:24:08,039 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2022-12-13 11:24:08,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.0) internal successors, (90), 29 states have internal predecessors, (90), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:24:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2022-12-13 11:24:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 11:24:08,039 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:24:08,039 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:24:08,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 11:24:08,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 11:24:08,241 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:24:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:24:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1833826551, now seen corresponding path program 7 times [2022-12-13 11:24:08,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:24:08,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442387106] [2022-12-13 11:24:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:24:08,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:24:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:24:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:24:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:08,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:24:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:08,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:24:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 11:24:08,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:24:08,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442387106] [2022-12-13 11:24:08,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442387106] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:24:08,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925909763] [2022-12-13 11:24:08,487 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 11:24:08,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:24:08,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:24:08,488 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:24:08,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 11:24:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:08,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 11:24:08,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:24:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-13 11:24:08,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:24:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-13 11:24:08,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925909763] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:24:08,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:24:08,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 23 [2022-12-13 11:24:08,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990152134] [2022-12-13 11:24:08,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:24:08,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 11:24:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:24:08,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 11:24:08,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-12-13 11:24:08,751 INFO L87 Difference]: Start difference. First operand 165 states and 202 transitions. Second operand has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 22 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:24:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:24:09,486 INFO L93 Difference]: Finished difference Result 306 states and 376 transitions. [2022-12-13 11:24:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:24:09,487 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 22 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2022-12-13 11:24:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:24:09,488 INFO L225 Difference]: With dead ends: 306 [2022-12-13 11:24:09,488 INFO L226 Difference]: Without dead ends: 231 [2022-12-13 11:24:09,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2022-12-13 11:24:09,489 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 99 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:24:09,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 594 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:24:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-12-13 11:24:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 167. [2022-12-13 11:24:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 154 states have (on average 1.1948051948051948) internal successors, (184), 154 states have internal predecessors, (184), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 11:24:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2022-12-13 11:24:09,598 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 77 [2022-12-13 11:24:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:24:09,598 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2022-12-13 11:24:09,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 22 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 11:24:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2022-12-13 11:24:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 11:24:09,599 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:24:09,599 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:24:09,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 11:24:09,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:24:09,801 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:24:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:24:09,802 INFO L85 PathProgramCache]: Analyzing trace with hash 91015209, now seen corresponding path program 8 times [2022-12-13 11:24:09,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:24:09,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595608552] [2022-12-13 11:24:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:24:09,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:24:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:25,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:24:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:25,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 11:24:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:25,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 11:24:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:25,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 11:24:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 11:24:25,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:24:25,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595608552] [2022-12-13 11:24:25,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595608552] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:24:25,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548001092] [2022-12-13 11:24:25,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:24:25,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:24:25,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:24:25,288 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:24:25,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e62aaf3-01b9-4f3a-86cd-8ae1251eb5d2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 11:24:25,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:24:25,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:24:25,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 160 conjunts are in the unsatisfiable core [2022-12-13 11:24:25,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:24:25,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:24:25,458 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 7 treesize of output 6 [2022-12-13 11:24:25,550 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:24:25,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:24:25,616 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_854 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_854))) is different from true [2022-12-13 11:24:25,623 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 13 treesize of output 15 [2022-12-13 11:24:25,688 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 13 treesize of output 15 [2022-12-13 11:24:25,759 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 13 treesize of output 15 [2022-12-13 11:24:25,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-13 11:24:25,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 11:24:25,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-12-13 11:24:25,993 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 11:24:25,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-12-13 11:24:26,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-12-13 11:24:26,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-12-13 11:24:26,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2022-12-13 11:24:27,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2022-12-13 11:24:28,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2022-12-13 11:24:28,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2022-12-13 11:24:29,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 88 [2022-12-13 11:24:32,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 172 [2022-12-13 11:24:32,357 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 93 treesize of output 81 [2022-12-13 11:24:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2022-12-13 11:24:32,456 INFO L328 TraceCheckSpWp]: Computing backward predicates...