./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-tiling/nr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/nr4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3219130777e42bfc39497c312a66c6d1b1af231a6df358861eaa545434d20cb1 --- 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-38b53e6 [2022-11-26 00:50:54,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:50:54,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:50:54,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:50:54,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:50:54,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:50:54,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:50:54,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:50:54,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:50:54,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:50:54,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:50:54,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:50:54,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:50:54,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:50:54,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:50:54,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:50:54,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:50:54,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:50:54,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:50:54,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:50:54,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:50:54,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:50:54,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:50:54,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:50:54,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:50:54,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:50:54,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:50:54,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:50:54,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:50:54,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:50:54,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:50:54,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:50:54,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:50:54,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:50:54,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:50:54,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:50:54,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:50:54,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:50:54,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:50:54,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:50:54,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:50:54,458 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 00:50:54,493 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:50:54,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:50:54,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:50:54,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:50:54,500 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:50:54,500 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:50:54,500 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:50:54,501 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:50:54,501 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:50:54,501 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:50:54,502 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:50:54,503 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:50:54,503 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:50:54,503 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:50:54,504 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:50:54,504 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:50:54,504 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:50:54,505 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:50:54,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:50:54,506 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:50:54,506 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:50:54,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:50:54,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:50:54,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:50:54,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:50:54,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:50:54,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:50:54,508 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:50:54,508 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:50:54,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:50:54,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:50:54,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:50:54,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:50:54,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:50:54,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:50:54,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:50:54,511 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:50:54,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:50:54,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:50:54,512 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:50:54,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:50:54,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:50:54,512 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:50:54,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/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_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 3219130777e42bfc39497c312a66c6d1b1af231a6df358861eaa545434d20cb1 [2022-11-26 00:50:54,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:50:54,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:50:54,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:50:54,837 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:50:54,838 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:50:54,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-tiling/nr4.c [2022-11-26 00:50:57,983 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:50:58,188 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:50:58,189 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/sv-benchmarks/c/array-tiling/nr4.c [2022-11-26 00:50:58,195 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/data/28e4fd883/0ec5e64c9a47417ea4dfaefbba4ec6c5/FLAG9ec6bdf96 [2022-11-26 00:50:58,211 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/data/28e4fd883/0ec5e64c9a47417ea4dfaefbba4ec6c5 [2022-11-26 00:50:58,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:50:58,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:50:58,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:50:58,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:50:58,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:50:58,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a555d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58, skipping insertion in model container [2022-11-26 00:50:58,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:50:58,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:50:58,399 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_12480c50-ccee-4591-a742-1669d1e92c90/sv-benchmarks/c/array-tiling/nr4.c[394,407] [2022-11-26 00:50:58,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:50:58,427 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:50:58,439 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_12480c50-ccee-4591-a742-1669d1e92c90/sv-benchmarks/c/array-tiling/nr4.c[394,407] [2022-11-26 00:50:58,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:50:58,466 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:50:58,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58 WrapperNode [2022-11-26 00:50:58,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:50:58,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:50:58,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:50:58,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:50:58,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,506 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-11-26 00:50:58,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:50:58,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:50:58,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:50:58,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:50:58,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,530 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:50:58,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:50:58,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:50:58,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:50:58,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (1/1) ... [2022-11-26 00:50:58,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:50:58,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:50:58,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:50:58,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:50:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:50:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:50:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:50:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:50:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:50:58,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:50:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:50:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:50:58,724 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:50:58,727 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:50:58,976 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:50:59,043 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:50:59,043 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-26 00:50:59,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:50:59 BoogieIcfgContainer [2022-11-26 00:50:59,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:50:59,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:50:59,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:50:59,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:50:59,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:50:58" (1/3) ... [2022-11-26 00:50:59,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51200f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:50:59, skipping insertion in model container [2022-11-26 00:50:59,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:58" (2/3) ... [2022-11-26 00:50:59,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51200f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:50:59, skipping insertion in model container [2022-11-26 00:50:59,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:50:59" (3/3) ... [2022-11-26 00:50:59,056 INFO L112 eAbstractionObserver]: Analyzing ICFG nr4.c [2022-11-26 00:50:59,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:50:59,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-26 00:50:59,180 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:50:59,190 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=FINITE_AUTOMATA, 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;@383193, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:50:59,191 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-26 00:50:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:50:59,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:50:59,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:50:59,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:50:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:50:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash 4507266, now seen corresponding path program 1 times [2022-11-26 00:50:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:50:59,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41422352] [2022-11-26 00:50:59,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:59,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:50:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:59,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:50:59,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41422352] [2022-11-26 00:50:59,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41422352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:50:59,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:50:59,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:50:59,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63624237] [2022-11-26 00:50:59,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:50:59,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:50:59,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:50:59,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:50:59,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:50:59,691 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:50:59,758 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-26 00:50:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:50:59,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-26 00:50:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:50:59,769 INFO L225 Difference]: With dead ends: 58 [2022-11-26 00:50:59,769 INFO L226 Difference]: Without dead ends: 40 [2022-11-26 00:50:59,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:50:59,779 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 87 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:50:59,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 38 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:50:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-26 00:50:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-26 00:50:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-11-26 00:50:59,817 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 4 [2022-11-26 00:50:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:50:59,817 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-11-26 00:50:59,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-11-26 00:50:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:50:59,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:50:59,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:50:59,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:50:59,819 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:50:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:50:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash 139725300, now seen corresponding path program 1 times [2022-11-26 00:50:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:50:59,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554971096] [2022-11-26 00:50:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:50:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:00,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:00,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554971096] [2022-11-26 00:51:00,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554971096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:00,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:00,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:51:00,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122485074] [2022-11-26 00:51:00,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:00,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:51:00,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:00,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:51:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:51:00,165 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:00,217 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-11-26 00:51:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:51:00,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-26 00:51:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:00,232 INFO L225 Difference]: With dead ends: 40 [2022-11-26 00:51:00,232 INFO L226 Difference]: Without dead ends: 39 [2022-11-26 00:51:00,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:51:00,234 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:00,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 33 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:51:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-26 00:51:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-26 00:51:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.68) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-11-26 00:51:00,240 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 5 [2022-11-26 00:51:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:00,241 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-11-26 00:51:00,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-11-26 00:51:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:51:00,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:00,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:00,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:51:00,243 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash 733164359, now seen corresponding path program 1 times [2022-11-26 00:51:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:00,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749961846] [2022-11-26 00:51:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:00,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:00,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749961846] [2022-11-26 00:51:00,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749961846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:00,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:00,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:51:00,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881837738] [2022-11-26 00:51:00,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:00,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:51:00,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:00,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:51:00,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:00,329 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:00,410 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-11-26 00:51:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:51:00,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-26 00:51:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:00,413 INFO L225 Difference]: With dead ends: 98 [2022-11-26 00:51:00,415 INFO L226 Difference]: Without dead ends: 62 [2022-11-26 00:51:00,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:00,418 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:00,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 49 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:51:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-26 00:51:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2022-11-26 00:51:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-11-26 00:51:00,436 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 8 [2022-11-26 00:51:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:00,437 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-11-26 00:51:00,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-11-26 00:51:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:51:00,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:00,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:00,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:51:00,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:00,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:00,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1253145385, now seen corresponding path program 1 times [2022-11-26 00:51:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:00,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037150688] [2022-11-26 00:51:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:00,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:00,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037150688] [2022-11-26 00:51:00,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037150688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:00,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:00,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:51:00,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219953493] [2022-11-26 00:51:00,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:00,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:51:00,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:00,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:51:00,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:51:00,582 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:00,646 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-11-26 00:51:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:51:00,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:51:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:00,648 INFO L225 Difference]: With dead ends: 45 [2022-11-26 00:51:00,650 INFO L226 Difference]: Without dead ends: 43 [2022-11-26 00:51:00,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:51:00,652 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:00,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 86 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:51:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-26 00:51:00,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-26 00:51:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-11-26 00:51:00,671 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 9 [2022-11-26 00:51:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:00,672 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-11-26 00:51:00,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-11-26 00:51:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:51:00,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:00,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:51:00,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1253164894, now seen corresponding path program 1 times [2022-11-26 00:51:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:00,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007478965] [2022-11-26 00:51:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:00,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:00,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007478965] [2022-11-26 00:51:00,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007478965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:00,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:00,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:51:00,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535278982] [2022-11-26 00:51:00,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:00,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:51:00,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:00,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:51:00,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:51:00,806 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:00,891 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-11-26 00:51:00,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:51:00,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:51:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:00,893 INFO L225 Difference]: With dead ends: 97 [2022-11-26 00:51:00,893 INFO L226 Difference]: Without dead ends: 57 [2022-11-26 00:51:00,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:51:00,895 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:00,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 53 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:51:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-26 00:51:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2022-11-26 00:51:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-11-26 00:51:00,924 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 9 [2022-11-26 00:51:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:00,924 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-11-26 00:51:00,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-11-26 00:51:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:51:00,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:00,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:00,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:51:00,925 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:00,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:00,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1253164574, now seen corresponding path program 1 times [2022-11-26 00:51:00,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:00,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188937496] [2022-11-26 00:51:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:00,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:01,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:01,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188937496] [2022-11-26 00:51:01,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188937496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:01,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:01,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:51:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357311509] [2022-11-26 00:51:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:01,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:51:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:01,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:51:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:01,006 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:01,083 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-26 00:51:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:51:01,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:51:01,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:01,088 INFO L225 Difference]: With dead ends: 77 [2022-11-26 00:51:01,088 INFO L226 Difference]: Without dead ends: 73 [2022-11-26 00:51:01,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:01,091 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:01,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:51:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-26 00:51:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2022-11-26 00:51:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-11-26 00:51:01,117 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 9 [2022-11-26 00:51:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:01,118 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-11-26 00:51:01,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-11-26 00:51:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:51:01,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:01,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:01,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:51:01,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1700315104, now seen corresponding path program 1 times [2022-11-26 00:51:01,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:01,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036984109] [2022-11-26 00:51:01,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:01,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:01,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036984109] [2022-11-26 00:51:01,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036984109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:01,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:01,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:51:01,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991125362] [2022-11-26 00:51:01,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:01,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:51:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:01,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:51:01,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:51:01,217 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:01,306 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-11-26 00:51:01,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:51:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-26 00:51:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:01,309 INFO L225 Difference]: With dead ends: 84 [2022-11-26 00:51:01,310 INFO L226 Difference]: Without dead ends: 82 [2022-11-26 00:51:01,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:51:01,313 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:01,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 45 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:51:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-26 00:51:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2022-11-26 00:51:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.5) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-11-26 00:51:01,338 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 11 [2022-11-26 00:51:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:01,338 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-11-26 00:51:01,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-11-26 00:51:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:51:01,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:01,340 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:01,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:51:01,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:01,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash 598563555, now seen corresponding path program 1 times [2022-11-26 00:51:01,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:01,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057711765] [2022-11-26 00:51:01,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:51:01,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:01,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057711765] [2022-11-26 00:51:01,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057711765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:01,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:01,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:51:01,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471444235] [2022-11-26 00:51:01,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:01,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:51:01,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:01,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:51:01,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:51:01,549 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:01,624 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-11-26 00:51:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:51:01,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-26 00:51:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:01,626 INFO L225 Difference]: With dead ends: 85 [2022-11-26 00:51:01,626 INFO L226 Difference]: Without dead ends: 76 [2022-11-26 00:51:01,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:51:01,627 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 90 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:01,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 36 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:51:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-26 00:51:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-11-26 00:51:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-11-26 00:51:01,634 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 12 [2022-11-26 00:51:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:01,634 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-11-26 00:51:01,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-11-26 00:51:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:51:01,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:01,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:01,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:51:01,636 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -756947920, now seen corresponding path program 1 times [2022-11-26 00:51:01,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:01,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643911658] [2022-11-26 00:51:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:01,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:01,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:01,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643911658] [2022-11-26 00:51:01,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643911658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:01,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:01,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:51:01,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082016136] [2022-11-26 00:51:01,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:01,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:51:01,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:01,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:51:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:51:01,680 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:01,739 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-11-26 00:51:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:51:01,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-26 00:51:01,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:01,740 INFO L225 Difference]: With dead ends: 82 [2022-11-26 00:51:01,740 INFO L226 Difference]: Without dead ends: 80 [2022-11-26 00:51:01,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:51:01,741 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:01,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:51:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-26 00:51:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2022-11-26 00:51:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.467741935483871) internal successors, (91), 75 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-11-26 00:51:01,748 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 14 [2022-11-26 00:51:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:01,749 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-11-26 00:51:01,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-11-26 00:51:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:51:01,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:01,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:01,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:51:01,750 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:01,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:01,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1657085202, now seen corresponding path program 1 times [2022-11-26 00:51:01,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:01,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463453417] [2022-11-26 00:51:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:01,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:51:01,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:01,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463453417] [2022-11-26 00:51:01,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463453417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:01,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:01,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:51:01,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834916784] [2022-11-26 00:51:01,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:01,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:51:01,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:01,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:51:01,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:51:01,800 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:01,878 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-11-26 00:51:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:51:01,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-26 00:51:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:01,879 INFO L225 Difference]: With dead ends: 86 [2022-11-26 00:51:01,879 INFO L226 Difference]: Without dead ends: 84 [2022-11-26 00:51:01,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:51:01,880 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:01,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 60 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:51:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-26 00:51:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-11-26 00:51:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.453125) internal successors, (93), 77 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-11-26 00:51:01,887 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 17 [2022-11-26 00:51:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:01,888 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-11-26 00:51:01,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-11-26 00:51:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:51:01,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:01,889 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:01,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:51:01,889 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash 38751577, now seen corresponding path program 1 times [2022-11-26 00:51:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:01,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212895288] [2022-11-26 00:51:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:01,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:01,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212895288] [2022-11-26 00:51:01,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212895288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:01,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719898024] [2022-11-26 00:51:01,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:01,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:01,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:01,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:02,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:51:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:02,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:51:02,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:02,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:02,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719898024] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:51:02,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1369539488] [2022-11-26 00:51:02,277 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-26 00:51:02,277 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:51:02,281 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:51:02,286 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:51:02,287 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:51:02,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,431 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:51:02,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-26 00:51:02,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-26 00:51:02,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-26 00:51:02,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 20 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 110 [2022-11-26 00:51:03,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:03,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:03,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:03,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:03,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:03,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:03,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:51:03,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:03,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:03,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:03,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:03,781 INFO L321 Elim1Store]: treesize reduction 127, result has 5.2 percent of original size [2022-11-26 00:51:03,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 25 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 615 treesize of output 597 [2022-11-26 00:51:03,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:04,243 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:51:07,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1369539488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:07,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:51:07,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 6, 6] total 25 [2022-11-26 00:51:07,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925688447] [2022-11-26 00:51:07,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:07,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:51:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:07,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:51:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2022-11-26 00:51:07,009 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:09,725 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2022-11-26 00:51:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:51:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-26 00:51:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:09,727 INFO L225 Difference]: With dead ends: 132 [2022-11-26 00:51:09,727 INFO L226 Difference]: Without dead ends: 82 [2022-11-26 00:51:09,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:51:09,728 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 165 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:09,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 64 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:51:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-26 00:51:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2022-11-26 00:51:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-11-26 00:51:09,739 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 20 [2022-11-26 00:51:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:09,740 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-11-26 00:51:09,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-11-26 00:51:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-26 00:51:09,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:09,741 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:09,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:51:09,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:09,947 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1747968747, now seen corresponding path program 1 times [2022-11-26 00:51:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:09,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107358800] [2022-11-26 00:51:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:51:10,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:10,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107358800] [2022-11-26 00:51:10,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107358800] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:10,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353191555] [2022-11-26 00:51:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:10,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:10,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:10,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:10,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:51:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:10,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:51:10,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:51:10,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:51:10,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353191555] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:51:10,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1283466286] [2022-11-26 00:51:10,313 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-26 00:51:10,313 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:51:10,313 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:51:10,314 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:51:10,314 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:51:10,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:10,374 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:51:10,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-26 00:51:10,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:10,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-26 00:51:10,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:10,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-26 00:51:10,595 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:10,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:10,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:10,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 20 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 110 [2022-11-26 00:51:10,831 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:11,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:11,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:11,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:11,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:11,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:11,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:11,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:51:11,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:11,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:11,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:11,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:11,507 INFO L321 Elim1Store]: treesize reduction 127, result has 5.2 percent of original size [2022-11-26 00:51:11,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 25 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 651 treesize of output 633 [2022-11-26 00:51:11,890 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:12,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:12,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:12,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:12,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:12,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:12,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:13,002 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:51:15,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1283466286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:15,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:51:15,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 6, 6] total 26 [2022-11-26 00:51:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659829024] [2022-11-26 00:51:15,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:15,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:51:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:15,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:51:15,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:51:15,175 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:18,756 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2022-11-26 00:51:18,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:51:18,757 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-26 00:51:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:18,757 INFO L225 Difference]: With dead ends: 120 [2022-11-26 00:51:18,757 INFO L226 Difference]: Without dead ends: 72 [2022-11-26 00:51:18,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 00:51:18,759 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 58 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:18,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 29 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:51:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-26 00:51:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-11-26 00:51:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-26 00:51:18,770 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 33 [2022-11-26 00:51:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:18,771 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-26 00:51:18,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-26 00:51:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 00:51:18,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:18,772 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:18,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:51:18,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 00:51:18,983 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:18,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:18,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2124968820, now seen corresponding path program 1 times [2022-11-26 00:51:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:18,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593392055] [2022-11-26 00:51:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:18,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:51:19,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:19,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593392055] [2022-11-26 00:51:19,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593392055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:19,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551937415] [2022-11-26 00:51:19,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:19,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:19,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:19,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:19,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:51:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:19,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:51:19,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:51:19,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:51:19,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551937415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:51:19,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1357855350] [2022-11-26 00:51:19,355 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-26 00:51:19,355 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:51:19,355 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:51:19,356 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:51:19,356 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:51:19,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:19,419 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-26 00:51:19,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 42 [2022-11-26 00:51:19,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:19,466 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:51:19,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-26 00:51:19,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:19,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-26 00:51:19,636 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:19,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:19,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:19,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 20 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 110 [2022-11-26 00:51:19,852 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:20,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:20,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:20,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:20,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:20,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:20,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:20,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:51:20,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:20,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:20,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:20,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:20,337 INFO L321 Elim1Store]: treesize reduction 127, result has 5.2 percent of original size [2022-11-26 00:51:20,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 25 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 651 treesize of output 633 [2022-11-26 00:51:20,621 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:20,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:20,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:21,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:21,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:21,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:21,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:22,046 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:51:24,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1357855350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:24,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:51:24,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 6, 6] total 31 [2022-11-26 00:51:24,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094389090] [2022-11-26 00:51:24,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:24,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 00:51:24,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:24,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 00:51:24,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:51:24,367 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:30,241 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-11-26 00:51:30,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:51:30,241 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-26 00:51:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:30,242 INFO L225 Difference]: With dead ends: 67 [2022-11-26 00:51:30,242 INFO L226 Difference]: Without dead ends: 66 [2022-11-26 00:51:30,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 75 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=431, Invalid=1825, Unknown=0, NotChecked=0, Total=2256 [2022-11-26 00:51:30,244 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:30,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:51:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-26 00:51:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-11-26 00:51:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.15) internal successors, (69), 63 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-11-26 00:51:30,254 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 36 [2022-11-26 00:51:30,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:30,255 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-11-26 00:51:30,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-11-26 00:51:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-26 00:51:30,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:30,256 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] [2022-11-26 00:51:30,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-26 00:51:30,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 00:51:30,462 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1449523844, now seen corresponding path program 1 times [2022-11-26 00:51:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:30,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052380074] [2022-11-26 00:51:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:51:30,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:30,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052380074] [2022-11-26 00:51:30,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052380074] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:30,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867623021] [2022-11-26 00:51:30,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:30,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:30,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:30,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:30,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:51:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:30,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:51:30,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:51:30,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:51:30,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867623021] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:51:30,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [624092302] [2022-11-26 00:51:30,819 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-26 00:51:30,819 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:51:30,820 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:51:30,820 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:51:30,820 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:51:30,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:30,877 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-26 00:51:30,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 42 [2022-11-26 00:51:30,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:30,925 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:51:30,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-26 00:51:31,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-26 00:51:31,113 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:31,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 20 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 110 [2022-11-26 00:51:31,324 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:31,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:51:31,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:31,884 INFO L321 Elim1Store]: treesize reduction 127, result has 5.2 percent of original size [2022-11-26 00:51:31,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 25 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 651 treesize of output 633 [2022-11-26 00:51:32,216 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:32,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:32,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:32,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:32,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:32,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:32,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:33,446 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:51:35,930 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3021#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 1 ~CELLCOUNT~0) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< 2147483646 |ULTIMATE.start_main_#t~post7#1|) (<= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-26 00:51:35,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:51:35,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:51:35,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2022-11-26 00:51:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604022237] [2022-11-26 00:51:35,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:51:35,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:51:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:35,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:51:35,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:51:35,940 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:36,358 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2022-11-26 00:51:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 00:51:36,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-26 00:51:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:36,359 INFO L225 Difference]: With dead ends: 158 [2022-11-26 00:51:36,360 INFO L226 Difference]: Without dead ends: 102 [2022-11-26 00:51:36,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=269, Invalid=1623, Unknown=0, NotChecked=0, Total=1892 [2022-11-26 00:51:36,361 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 148 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:36,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 81 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:51:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-26 00:51:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-11-26 00:51:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.1030927835051547) internal successors, (107), 100 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2022-11-26 00:51:36,382 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 37 [2022-11-26 00:51:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:36,383 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2022-11-26 00:51:36,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2022-11-26 00:51:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-26 00:51:36,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:36,385 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:36,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-26 00:51:36,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:36,590 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:36,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:36,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1776495160, now seen corresponding path program 2 times [2022-11-26 00:51:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:36,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222120838] [2022-11-26 00:51:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-26 00:51:36,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222120838] [2022-11-26 00:51:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222120838] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370156649] [2022-11-26 00:51:36,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:51:36,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:36,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:36,754 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:36,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:51:36,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-26 00:51:36,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:51:36,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:51:36,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-26 00:51:36,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-26 00:51:37,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370156649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:51:37,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1374986649] [2022-11-26 00:51:37,035 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-26 00:51:37,036 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:51:37,036 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:51:37,036 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:51:37,036 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:51:37,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,092 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:51:37,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-26 00:51:37,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-26 00:51:37,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 95 [2022-11-26 00:51:37,264 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:37,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 20 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 110 [2022-11-26 00:51:37,450 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:37,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:51:37,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:37,852 INFO L321 Elim1Store]: treesize reduction 127, result has 5.2 percent of original size [2022-11-26 00:51:37,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 25 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 651 treesize of output 633 [2022-11-26 00:51:38,127 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:51:38,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:38,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:38,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:38,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:38,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:38,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:51:39,304 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:51:41,793 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3714#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 1 ~CELLCOUNT~0) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< 2147483646 |ULTIMATE.start_main_#t~post7#1|) (<= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-26 00:51:41,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:51:41,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:51:41,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 2, 2] total 9 [2022-11-26 00:51:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417289469] [2022-11-26 00:51:41,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:51:41,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:51:41,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:41,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:51:41,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2022-11-26 00:51:41,795 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:42,024 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-11-26 00:51:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:51:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-26 00:51:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:42,026 INFO L225 Difference]: With dead ends: 104 [2022-11-26 00:51:42,026 INFO L226 Difference]: Without dead ends: 90 [2022-11-26 00:51:42,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 14 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:51:42,027 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:42,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 71 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:51:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-26 00:51:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-26 00:51:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 87 states have (on average 1.0919540229885059) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-11-26 00:51:42,046 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 58 [2022-11-26 00:51:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:42,046 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-11-26 00:51:42,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-11-26 00:51:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-26 00:51:42,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:42,056 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:42,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:51:42,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-26 00:51:42,261 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1292863958, now seen corresponding path program 1 times [2022-11-26 00:51:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:42,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601360996] [2022-11-26 00:51:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-26 00:51:42,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:42,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601360996] [2022-11-26 00:51:42,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601360996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:42,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:42,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:51:42,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701426005] [2022-11-26 00:51:42,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:42,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:51:42,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:42,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:51:42,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:42,305 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:42,335 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-11-26 00:51:42,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:51:42,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-11-26 00:51:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:42,338 INFO L225 Difference]: With dead ends: 90 [2022-11-26 00:51:42,338 INFO L226 Difference]: Without dead ends: 88 [2022-11-26 00:51:42,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:42,339 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:42,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 16 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:51:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-26 00:51:42,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-26 00:51:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-11-26 00:51:42,353 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 61 [2022-11-26 00:51:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:42,354 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-11-26 00:51:42,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-11-26 00:51:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-26 00:51:42,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:42,358 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-26 00:51:42,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 00:51:42,359 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:51:42,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:42,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1687477280, now seen corresponding path program 1 times [2022-11-26 00:51:42,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:42,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711717949] [2022-11-26 00:51:42,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:42,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-26 00:51:42,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:42,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711717949] [2022-11-26 00:51:42,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711717949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:42,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:42,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:51:42,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059833635] [2022-11-26 00:51:42,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:42,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:51:42,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:42,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:51:42,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:51:42,516 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:42,556 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-11-26 00:51:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:51:42,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-11-26 00:51:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:42,557 INFO L225 Difference]: With dead ends: 88 [2022-11-26 00:51:42,557 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:51:42,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:51:42,558 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:42,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 22 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:51:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:51:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:51:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:51:42,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2022-11-26 00:51:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:42,560 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:51:42,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:51:42,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:51:42,563 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-11-26 00:51:42,563 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-11-26 00:51:42,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-11-26 00:51:42,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-11-26 00:51:42,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-11-26 00:51:42,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-11-26 00:51:42,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-11-26 00:51:42,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-11-26 00:51:42,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-11-26 00:51:42,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-11-26 00:51:42,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-11-26 00:51:42,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-11-26 00:51:42,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-11-26 00:51:42,566 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-11-26 00:51:42,566 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-11-26 00:51:42,566 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-11-26 00:51:42,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 00:51:42,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:51:43,955 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-26 00:51:43,955 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-11-26 00:51:43,955 INFO L899 garLoopResultBuilder]: For program point L27-2(lines 27 40) no Hoare annotation was computed. [2022-11-26 00:51:43,955 INFO L899 garLoopResultBuilder]: For program point L27-5(line 27) no Hoare annotation was computed. [2022-11-26 00:51:43,956 INFO L899 garLoopResultBuilder]: For program point L27-6(line 27) no Hoare annotation was computed. [2022-11-26 00:51:43,958 INFO L895 garLoopResultBuilder]: At program point L27-7(lines 27 40) the Hoare annotation is: (let ((.cse26 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse30 (select |#memory_int| 1)) (.cse27 (select |#memory_int| 2))) (let ((.cse0 (= (select |#length| 3) 12)) (.cse1 (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|))) (.cse2 (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1)) (.cse3 (= (select .cse27 5) 0)) (.cse4 (= 114 (select .cse27 1))) (.cse5 (<= 2 ~CELLCOUNT~0)) (.cse6 (= 52 (select .cse27 2))) (.cse7 (= 2 (select |#length| 1))) (.cse8 (= (select |#valid| 3) 1)) (.cse9 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse10 (<= ~CELLCOUNT~0 2147483647)) (.cse11 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse12 (= (select |#valid| 1) 1)) (.cse13 (= (select .cse27 4) 99)) (.cse14 (= (select .cse27 0) 110)) (.cse15 (= (select |#valid| 0) 0)) (.cse16 (= (select |#valid| 2) 1)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= (select .cse30 0) 48)) (.cse19 (= (select .cse30 1) 0)) (.cse20 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse21 (or (let ((.cse28 (= (let ((.cse29 (mod ~CELLCOUNT~0 4))) (ite (and (not (= .cse29 0)) (< ~CELLCOUNT~0 0)) (+ .cse29 (- 4)) .cse29)) 0))) (and .cse26 .cse28 (not (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (ite .cse28 1 0) |ULTIMATE.start_assume_abort_if_not_#in~cond#1|))) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| 1)))) (.cse22 (= 46 (select .cse27 3))) (.cse23 (= 6 (select |#length| 2))) (.cse24 (< 0 |#StackHeapBarrier|)) (.cse25 (= |#NULL.base| 0))) (or (and .cse0 (<= 0 (+ |ULTIMATE.start_main_~j~0#1| 2147483648)) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~i~0#1| 2147483647) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) .cse12 .cse13 .cse14 (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 4) 4)) .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse19 .cse20 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| |ULTIMATE.start_assume_abort_if_not_~cond#1|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2022-11-26 00:51:43,958 INFO L899 garLoopResultBuilder]: For program point L27-8(lines 27 40) no Hoare annotation was computed. [2022-11-26 00:51:43,958 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2022-11-26 00:51:43,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-26 00:51:43,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-26 00:51:43,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:51:43,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-26 00:51:43,959 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-11-26 00:51:43,959 INFO L899 garLoopResultBuilder]: For program point L37-1(line 37) no Hoare annotation was computed. [2022-11-26 00:51:43,960 INFO L899 garLoopResultBuilder]: For program point L37-2(line 37) no Hoare annotation was computed. [2022-11-26 00:51:43,960 INFO L899 garLoopResultBuilder]: For program point L37-3(line 37) no Hoare annotation was computed. [2022-11-26 00:51:43,960 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-26 00:51:43,960 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 39) no Hoare annotation was computed. [2022-11-26 00:51:43,960 INFO L899 garLoopResultBuilder]: For program point L29-3(line 29) no Hoare annotation was computed. [2022-11-26 00:51:43,960 INFO L899 garLoopResultBuilder]: For program point L29-4(line 29) no Hoare annotation was computed. [2022-11-26 00:51:43,961 INFO L895 garLoopResultBuilder]: At program point L29-5(lines 29 39) the Hoare annotation is: (let ((.cse1 (select |#memory_int| 1)) (.cse0 (select |#memory_int| 2))) (and (= (select |#length| 3) 12) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| 2147483648)) (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1) (= (select .cse0 5) 0) (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 536870911) (= 114 (select .cse0 1)) (<= 2 ~CELLCOUNT~0) (= 52 (select .cse0 2)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= (select |#valid| 1) 1) (= (select .cse0 4) 99) (= (select .cse0 0) 110) (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 4) 4)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse1 0) 48) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select .cse1 1) 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= 46 (select .cse0 3)) (= 6 (select |#length| 2)) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 00:51:43,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-26 00:51:43,961 INFO L902 garLoopResultBuilder]: At program point L47(lines 13 48) the Hoare annotation is: true [2022-11-26 00:51:43,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-26 00:51:43,962 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 38) no Hoare annotation was computed. [2022-11-26 00:51:43,962 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-11-26 00:51:43,962 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-26 00:51:43,962 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-26 00:51:43,962 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 46) no Hoare annotation was computed. [2022-11-26 00:51:43,962 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-26 00:51:43,963 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 16 46) no Hoare annotation was computed. [2022-11-26 00:51:43,963 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-11-26 00:51:43,963 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:51:43,963 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-11-26 00:51:43,963 INFO L899 garLoopResultBuilder]: For program point L33-2(line 33) no Hoare annotation was computed. [2022-11-26 00:51:43,963 INFO L899 garLoopResultBuilder]: For program point L33-3(line 33) no Hoare annotation was computed. [2022-11-26 00:51:43,964 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-26 00:51:43,964 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-26 00:51:43,964 INFO L899 garLoopResultBuilder]: For program point L42-3(line 42) no Hoare annotation was computed. [2022-11-26 00:51:43,964 INFO L899 garLoopResultBuilder]: For program point L42-4(line 42) no Hoare annotation was computed. [2022-11-26 00:51:43,965 INFO L895 garLoopResultBuilder]: At program point L42-5(lines 42 45) the Hoare annotation is: (let ((.cse1 (select |#memory_int| 1)) (.cse0 (select |#memory_int| 2))) (and (= (select |#length| 3) 12) (= (* (mod ~CELLCOUNT~0 1073741824) 4) (select |#length| |ULTIMATE.start_main_~#volArray~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#volArray~0#1.base|) 1) (= (select .cse0 5) 0) (<= |ULTIMATE.start_main_~i~0#1| 2147483647) (= 114 (select .cse0 1)) (<= 2 ~CELLCOUNT~0) (= 52 (select .cse0 2)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= ~CELLCOUNT~0 2147483647) (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= (select |#valid| 1) 1) (= (select .cse0 4) 99) (= (select .cse0 0) 110) (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 4) 4)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse1 0) 48) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select .cse1 1) 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= 46 (select .cse0 3)) (= 6 (select |#length| 2)) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 00:51:43,965 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-26 00:51:43,965 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2022-11-26 00:51:43,965 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-26 00:51:43,969 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:43,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:51:43,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:51:43 BoogieIcfgContainer [2022-11-26 00:51:43,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:51:43,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:51:43,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:51:43,999 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:51:43,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:50:59" (3/4) ... [2022-11-26 00:51:44,002 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:51:44,012 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-26 00:51:44,013 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-26 00:51:44,013 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-26 00:51:44,013 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:51:44,014 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:51:44,039 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && 0 <= j + 2147483648) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && i <= 2147483647) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 52 == unknown-#memory_int-unknown[2][2]) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && ((((i == 1 && (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT % 4 + -4 else CELLCOUNT % 4) == 0) && !(cond == 0)) && (if (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT % 4 + -4 else CELLCOUNT % 4) == 0 then 1 else 0) == \old(cond)) || (2 <= i && j < 1))) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 52 == unknown-#memory_int-unknown[2][2]) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && \old(cond) == cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && ((((i == 1 && (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT % 4 + -4 else CELLCOUNT % 4) == 0) && !(cond == 0)) && (if (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT % 4 + -4 else CELLCOUNT % 4) == 0 then 1 else 0) == \old(cond)) || (2 <= i && j < 1))) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-26 00:51:44,039 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && i <= 2147483647) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 52 == unknown-#memory_int-unknown[2][2]) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= i) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 [2022-11-26 00:51:44,040 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && 0 <= j + 2147483648) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && j <= 4) && 1 <= i) && i <= 536870911) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 52 == unknown-#memory_int-unknown[2][2]) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 [2022-11-26 00:51:44,051 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:51:44,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:51:44,052 INFO L158 Benchmark]: Toolchain (without parser) took 45836.89ms. Allocated memory was 174.1MB in the beginning and 446.7MB in the end (delta: 272.6MB). Free memory was 129.7MB in the beginning and 299.5MB in the end (delta: -169.9MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2022-11-26 00:51:44,052 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 121.6MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:51:44,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.90ms. Allocated memory is still 174.1MB. Free memory was 129.7MB in the beginning and 118.6MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-26 00:51:44,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.28ms. Allocated memory is still 174.1MB. Free memory was 118.6MB in the beginning and 117.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:51:44,053 INFO L158 Benchmark]: Boogie Preprocessor took 26.43ms. Allocated memory is still 174.1MB. Free memory was 117.1MB in the beginning and 115.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:51:44,054 INFO L158 Benchmark]: RCFGBuilder took 511.57ms. Allocated memory is still 174.1MB. Free memory was 115.9MB in the beginning and 98.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-26 00:51:44,054 INFO L158 Benchmark]: TraceAbstraction took 44948.83ms. Allocated memory was 174.1MB in the beginning and 446.7MB in the end (delta: 272.6MB). Free memory was 98.2MB in the beginning and 302.7MB in the end (delta: -204.5MB). Peak memory consumption was 224.7MB. Max. memory is 16.1GB. [2022-11-26 00:51:44,054 INFO L158 Benchmark]: Witness Printer took 53.23ms. Allocated memory is still 446.7MB. Free memory was 302.7MB in the beginning and 299.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:51:44,056 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74ms. Allocated memory is still 121.6MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.90ms. Allocated memory is still 174.1MB. Free memory was 129.7MB in the beginning and 118.6MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.28ms. Allocated memory is still 174.1MB. Free memory was 118.6MB in the beginning and 117.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.43ms. Allocated memory is still 174.1MB. Free memory was 117.1MB in the beginning and 115.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.57ms. Allocated memory is still 174.1MB. Free memory was 115.9MB in the beginning and 98.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 44948.83ms. Allocated memory was 174.1MB in the beginning and 446.7MB in the end (delta: 272.6MB). Free memory was 98.2MB in the beginning and 302.7MB in the end (delta: -204.5MB). Peak memory consumption was 224.7MB. Max. memory is 16.1GB. * Witness Printer took 53.23ms. Allocated memory is still 446.7MB. Free memory was 302.7MB in the beginning and 299.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 44.8s, OverallIterations: 17, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 807 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 455 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1548 IncrementalHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 352 mSDtfsCounter, 1548 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 409 SyntacticMatches, 49 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2419 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=14, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 99 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 23 NumberOfFragments, 739 HoareAnnotationTreeSize, 4 FomulaSimplifications, 246 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 2489 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 614 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 771 ConstructedInterpolants, 0 QuantifiedInterpolants, 1970 SizeOfPredicates, 15 NumberOfNonLiveVariables, 559 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 584/633 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 7.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 92, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 422, TOOLS_POST_TIME: 6.3s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 358, TOOLS_QUANTIFIERELIM_TIME: 6.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 568, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 38, DOMAIN_JOIN_TIME: 0.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 11, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 29, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 92, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 18, LOOP_SUMMARIZER_CACHE_MISSES: 18, LOOP_SUMMARIZER_OVERALL_TIME: 5.3s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 5.3s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 29, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 3070, DAG_COMPRESSION_RETAINED_NODES: 265, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && i <= 2147483647) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 52 == unknown-#memory_int-unknown[2][2]) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= i) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && 0 <= j + 2147483648) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && i <= 2147483647) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 52 == unknown-#memory_int-unknown[2][2]) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && ((((i == 1 && (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT % 4 + -4 else CELLCOUNT % 4) == 0) && !(cond == 0)) && (if (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT % 4 + -4 else CELLCOUNT % 4) == 0 then 1 else 0) == \old(cond)) || (2 <= i && j < 1))) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 52 == unknown-#memory_int-unknown[2][2]) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && \old(cond) == cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && ((((i == 1 && (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT % 4 + -4 else CELLCOUNT % 4) == 0) && !(cond == 0)) && (if (if !(CELLCOUNT % 4 == 0) && CELLCOUNT < 0 then CELLCOUNT % 4 + -4 else CELLCOUNT % 4) == 0 then 1 else 0) == \old(cond)) || (2 <= i && j < 1))) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && 0 <= j + 2147483648) && CELLCOUNT % 1073741824 * 4 == unknown-#length-unknown[volArray]) && \valid[volArray] == 1) && unknown-#memory_int-unknown[2][5] == 0) && j <= 4) && 1 <= i) && i <= 536870911) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 52 == unknown-#memory_int-unknown[2][2]) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= cond) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && CELLCOUNT == CELLCOUNT / 4 * 4) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && cond <= 1) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 RESULT: Ultimate proved your program to be correct! [2022-11-26 00:51:44,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12480c50-ccee-4591-a742-1669d1e92c90/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE