./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-tiling/nr3.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_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/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_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/nr3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/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_41550e71-92c7-424c-9f60-1db43cfe4f4f/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 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 --- 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-25 23:47:32,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:47:32,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:47:32,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:47:32,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:47:32,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:47:32,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:47:32,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:47:32,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:47:32,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:47:32,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:47:32,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:47:32,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:47:32,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:47:32,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:47:32,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:47:32,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:47:32,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:47:32,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:47:32,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:47:32,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:47:32,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:47:32,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:47:32,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:47:32,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:47:32,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:47:32,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:47:32,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:47:32,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:47:32,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:47:32,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:47:32,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:47:32,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:47:32,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:47:32,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:47:32,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:47:32,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:47:32,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:47:32,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:47:32,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:47:32,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:47:32,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:47:32,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:47:32,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:47:32,464 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:47:32,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:47:32,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:47:32,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:47:32,466 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:47:32,467 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:47:32,467 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:47:32,467 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:47:32,468 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:47:32,469 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:47:32,469 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:47:32,469 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:47:32,470 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:47:32,470 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:47:32,470 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:47:32,471 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:47:32,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:47:32,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:47:32,472 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:47:32,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:47:32,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:47:32,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:47:32,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:47:32,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:47:32,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:47:32,475 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:47:32,475 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:47:32,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:47:32,476 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:47:32,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:47:32,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:47:32,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:47:32,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:47:32,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:47:32,478 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:47:32,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:47:32,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:47:32,479 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:47:32,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:47:32,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:47:32,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:47:32,480 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_41550e71-92c7-424c-9f60-1db43cfe4f4f/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_41550e71-92c7-424c-9f60-1db43cfe4f4f/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 -> 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 [2022-11-25 23:47:32,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:47:32,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:47:32,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:47:32,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:47:32,783 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:47:32,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-tiling/nr3.c [2022-11-25 23:47:35,839 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:47:36,032 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:47:36,033 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/sv-benchmarks/c/array-tiling/nr3.c [2022-11-25 23:47:36,039 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/data/360718689/6ec916b0e5e449309cf07c2956e83b51/FLAG10b44b8d6 [2022-11-25 23:47:36,062 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/data/360718689/6ec916b0e5e449309cf07c2956e83b51 [2022-11-25 23:47:36,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:47:36,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:47:36,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:47:36,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:47:36,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:47:36,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4fd9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36, skipping insertion in model container [2022-11-25 23:47:36,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:47:36,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:47:36,287 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_41550e71-92c7-424c-9f60-1db43cfe4f4f/sv-benchmarks/c/array-tiling/nr3.c[394,407] [2022-11-25 23:47:36,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:47:36,324 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:47:36,339 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_41550e71-92c7-424c-9f60-1db43cfe4f4f/sv-benchmarks/c/array-tiling/nr3.c[394,407] [2022-11-25 23:47:36,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:47:36,366 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:47:36,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36 WrapperNode [2022-11-25 23:47:36,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:47:36,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:47:36,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:47:36,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:47:36,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,405 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-11-25 23:47:36,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:47:36,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:47:36,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:47:36,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:47:36,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,429 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:47:36,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:47:36,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:47:36,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:47:36,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (1/1) ... [2022-11-25 23:47:36,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:47:36,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:36,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:47:36,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:47:36,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:47:36,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:47:36,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:47:36,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:47:36,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:47:36,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:47:36,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:47:36,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:47:36,626 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:47:36,628 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:47:36,872 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:47:36,967 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:47:36,968 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 23:47:36,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:47:36 BoogieIcfgContainer [2022-11-25 23:47:36,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:47:36,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:47:36,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:47:36,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:47:36,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:47:36" (1/3) ... [2022-11-25 23:47:36,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de38066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:47:36, skipping insertion in model container [2022-11-25 23:47:36,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:47:36" (2/3) ... [2022-11-25 23:47:36,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de38066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:47:36, skipping insertion in model container [2022-11-25 23:47:36,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:47:36" (3/3) ... [2022-11-25 23:47:36,980 INFO L112 eAbstractionObserver]: Analyzing ICFG nr3.c [2022-11-25 23:47:37,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:47:37,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-25 23:47:37,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:47:37,099 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;@2f7da81f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:47:37,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 23:47:37,103 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-25 23:47:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:47:37,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:37,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:47:37,109 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-25 23:47:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:37,115 INFO L85 PathProgramCache]: Analyzing trace with hash 4507266, now seen corresponding path program 1 times [2022-11-25 23:47:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:37,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512072893] [2022-11-25 23:47:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:37,553 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-25 23:47:37,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:37,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512072893] [2022-11-25 23:47:37,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512072893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:37,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:37,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:47:37,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566023630] [2022-11-25 23:47:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:37,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:47:37,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:37,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:47:37,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:47:37,592 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-25 23:47:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:37,739 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-25 23:47:37,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:47:37,743 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-25 23:47:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:37,752 INFO L225 Difference]: With dead ends: 58 [2022-11-25 23:47:37,752 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 23:47:37,755 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-25 23:47:37,761 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 87 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:37,762 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.1s Time] [2022-11-25 23:47:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 23:47:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-25 23:47:37,823 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-25 23:47:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-11-25 23:47:37,828 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 4 [2022-11-25 23:47:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:37,829 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-11-25 23:47:37,829 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-25 23:47:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-11-25 23:47:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:47:37,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:37,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:47:37,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:47:37,832 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-25 23:47:37,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:37,833 INFO L85 PathProgramCache]: Analyzing trace with hash 139725300, now seen corresponding path program 1 times [2022-11-25 23:47:37,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:37,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574809893] [2022-11-25 23:47:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:38,082 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-25 23:47:38,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:38,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574809893] [2022-11-25 23:47:38,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574809893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:38,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:38,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:47:38,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225760955] [2022-11-25 23:47:38,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:38,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:47:38,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:38,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:47:38,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:47:38,087 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-25 23:47:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:38,127 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-11-25 23:47:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:47:38,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-25 23:47:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:38,132 INFO L225 Difference]: With dead ends: 40 [2022-11-25 23:47:38,133 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 23:47:38,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:47:38,137 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:38,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 33 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:47:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 23:47:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-25 23:47:38,146 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-25 23:47:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-11-25 23:47:38,150 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 5 [2022-11-25 23:47:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:38,150 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-11-25 23:47:38,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-25 23:47:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-11-25 23:47:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:47:38,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:38,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:38,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:47:38,156 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-25 23:47:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:38,157 INFO L85 PathProgramCache]: Analyzing trace with hash 733164359, now seen corresponding path program 1 times [2022-11-25 23:47:38,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:38,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695941766] [2022-11-25 23:47:38,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:38,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:38,258 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-25 23:47:38,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:38,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695941766] [2022-11-25 23:47:38,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695941766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:38,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:38,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:47:38,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865228362] [2022-11-25 23:47:38,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:38,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:47:38,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:38,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:47:38,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:47:38,265 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-25 23:47:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:38,365 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-11-25 23:47:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:47:38,366 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-25 23:47:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:38,367 INFO L225 Difference]: With dead ends: 98 [2022-11-25 23:47:38,367 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 23:47:38,368 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-25 23:47:38,369 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-25 23:47:38,369 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-25 23:47:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 23:47:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2022-11-25 23:47:38,376 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-25 23:47:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-11-25 23:47:38,377 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 8 [2022-11-25 23:47:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:38,378 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-11-25 23:47:38,378 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-25 23:47:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-11-25 23:47:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:47:38,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:38,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:38,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:47:38,379 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-25 23:47:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1253145385, now seen corresponding path program 1 times [2022-11-25 23:47:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:38,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299104513] [2022-11-25 23:47:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:38,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:38,487 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-25 23:47:38,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:38,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299104513] [2022-11-25 23:47:38,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299104513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:38,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:38,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:47:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962532355] [2022-11-25 23:47:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:38,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:47:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:47:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:47:38,491 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-25 23:47:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:38,584 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-11-25 23:47:38,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:47:38,585 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-25 23:47:38,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:38,586 INFO L225 Difference]: With dead ends: 45 [2022-11-25 23:47:38,587 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 23:47:38,587 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-25 23:47:38,589 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:38,592 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.1s Time] [2022-11-25 23:47:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 23:47:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-25 23:47:38,603 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-25 23:47:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-11-25 23:47:38,608 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 9 [2022-11-25 23:47:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:38,609 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-11-25 23:47:38,609 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-25 23:47:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-11-25 23:47:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:47:38,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:38,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:38,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:47:38,612 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-25 23:47:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1253164894, now seen corresponding path program 1 times [2022-11-25 23:47:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:38,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003404271] [2022-11-25 23:47:38,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:38,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:38,702 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-25 23:47:38,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:38,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003404271] [2022-11-25 23:47:38,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003404271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:38,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:38,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:47:38,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411122383] [2022-11-25 23:47:38,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:38,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:47:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:38,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:47:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:47:38,705 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-25 23:47:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:38,770 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-11-25 23:47:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:47:38,771 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-25 23:47:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:38,771 INFO L225 Difference]: With dead ends: 97 [2022-11-25 23:47:38,771 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 23:47:38,772 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-25 23:47:38,773 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 50 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:38,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 53 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:47:38,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 23:47:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2022-11-25 23:47:38,778 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-25 23:47:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-11-25 23:47:38,779 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 9 [2022-11-25 23:47:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:38,779 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-11-25 23:47:38,780 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-25 23:47:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-11-25 23:47:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:47:38,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:38,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:38,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:47:38,781 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-25 23:47:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1253164574, now seen corresponding path program 1 times [2022-11-25 23:47:38,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:38,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804270013] [2022-11-25 23:47:38,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:38,810 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-25 23:47:38,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:38,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804270013] [2022-11-25 23:47:38,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804270013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:38,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:38,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:47:38,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885061011] [2022-11-25 23:47:38,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:38,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:47:38,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:38,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:47:38,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:47:38,813 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-25 23:47:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:38,890 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-25 23:47:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:47:38,891 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-25 23:47:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:38,892 INFO L225 Difference]: With dead ends: 77 [2022-11-25 23:47:38,892 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 23:47:38,892 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-25 23:47:38,893 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-25 23:47:38,894 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-25 23:47:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 23:47:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2022-11-25 23:47:38,901 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-25 23:47:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-11-25 23:47:38,902 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 9 [2022-11-25 23:47:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:38,903 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-11-25 23:47:38,903 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-25 23:47:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-11-25 23:47:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:47:38,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:38,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:38,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:47:38,904 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-25 23:47:38,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1700315104, now seen corresponding path program 1 times [2022-11-25 23:47:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:38,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692000067] [2022-11-25 23:47:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:38,951 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-25 23:47:38,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:38,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692000067] [2022-11-25 23:47:38,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692000067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:38,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:38,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:47:38,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955614635] [2022-11-25 23:47:38,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:38,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:47:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:47:38,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:47:38,953 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-25 23:47:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:39,056 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-11-25 23:47:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:47:39,057 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-25 23:47:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:39,057 INFO L225 Difference]: With dead ends: 84 [2022-11-25 23:47:39,058 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 23:47:39,058 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-25 23:47:39,059 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:39,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 48 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:47:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 23:47:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2022-11-25 23:47:39,066 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-25 23:47:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-11-25 23:47:39,067 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 11 [2022-11-25 23:47:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:39,068 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-11-25 23:47:39,068 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-25 23:47:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-11-25 23:47:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:47:39,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:39,069 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:39,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:47:39,069 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-25 23:47:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash 598563555, now seen corresponding path program 1 times [2022-11-25 23:47:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:39,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972432458] [2022-11-25 23:47:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:39,258 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-25 23:47:39,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:39,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972432458] [2022-11-25 23:47:39,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972432458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:39,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:39,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:47:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17075208] [2022-11-25 23:47:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:39,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:47:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:47:39,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:47:39,261 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-25 23:47:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:39,334 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-11-25 23:47:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:47:39,335 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-25 23:47:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:39,337 INFO L225 Difference]: With dead ends: 85 [2022-11-25 23:47:39,337 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 23:47:39,337 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-25 23:47:39,339 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-25 23:47:39,340 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-25 23:47:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 23:47:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-11-25 23:47:39,360 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-25 23:47:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-11-25 23:47:39,361 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 12 [2022-11-25 23:47:39,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:39,361 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-11-25 23:47:39,361 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-25 23:47:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-11-25 23:47:39,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:47:39,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:39,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:39,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:47:39,363 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-25 23:47:39,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash -756947920, now seen corresponding path program 1 times [2022-11-25 23:47:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:39,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279999285] [2022-11-25 23:47:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:39,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:39,419 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-25 23:47:39,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:39,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279999285] [2022-11-25 23:47:39,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279999285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:39,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:39,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:47:39,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422800944] [2022-11-25 23:47:39,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:39,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:47:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:39,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:47:39,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:47:39,422 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-25 23:47:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:39,500 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-11-25 23:47:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:47:39,502 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-25 23:47:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:39,503 INFO L225 Difference]: With dead ends: 82 [2022-11-25 23:47:39,503 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 23:47:39,503 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-25 23:47:39,504 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:39,504 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.1s Time] [2022-11-25 23:47:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 23:47:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2022-11-25 23:47:39,514 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-25 23:47:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2022-11-25 23:47:39,518 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 14 [2022-11-25 23:47:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:39,518 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2022-11-25 23:47:39,518 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-25 23:47:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-11-25 23:47:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:47:39,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:39,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:39,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:47:39,519 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-25 23:47:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1657085202, now seen corresponding path program 1 times [2022-11-25 23:47:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:39,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144062201] [2022-11-25 23:47:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:39,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:39,580 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-25 23:47:39,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:39,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144062201] [2022-11-25 23:47:39,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144062201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:39,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:39,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:47:39,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721401101] [2022-11-25 23:47:39,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:39,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:47:39,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:39,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:47:39,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:47:39,583 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-25 23:47:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:39,660 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-11-25 23:47:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:47:39,661 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-25 23:47:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:39,661 INFO L225 Difference]: With dead ends: 86 [2022-11-25 23:47:39,661 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 23:47:39,662 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-25 23:47:39,662 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-25 23:47:39,663 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-25 23:47:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 23:47:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-11-25 23:47:39,678 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-25 23:47:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-11-25 23:47:39,678 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 17 [2022-11-25 23:47:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:39,679 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-11-25 23:47:39,679 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-25 23:47:39,679 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-11-25 23:47:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:47:39,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:39,680 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-25 23:47:39,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:47:39,680 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-25 23:47:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:39,681 INFO L85 PathProgramCache]: Analyzing trace with hash 38751577, now seen corresponding path program 1 times [2022-11-25 23:47:39,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:39,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609788304] [2022-11-25 23:47:39,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:39,778 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-25 23:47:39,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:39,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609788304] [2022-11-25 23:47:39,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609788304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:39,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720757116] [2022-11-25 23:47:39,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:39,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:39,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:39,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:47:39,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:47:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:39,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:47:39,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:40,013 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-25 23:47:40,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:47:40,076 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-25 23:47:40,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720757116] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:47:40,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [382518624] [2022-11-25 23:47:40,096 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-25 23:47:40,096 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:47:40,100 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:47:40,105 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:47:40,106 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:47:40,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:40,243 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:47:40,243 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-25 23:47:40,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:40,269 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-25 23:47:40,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:40,488 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-25 23:47:40,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:40,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:40,685 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-25 23:47:41,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:41,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:41,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:41,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:41,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:41,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:41,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:41,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:41,352 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 23:47:41,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 615 treesize of output 585 [2022-11-25 23:47:41,776 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:47:45,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [382518624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:45,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:47:45,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 6, 6] total 21 [2022-11-25 23:47:45,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631888821] [2022-11-25 23:47:45,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:45,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:47:45,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:45,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:47:45,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:47:45,116 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-25 23:47:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:46,404 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2022-11-25 23:47:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:47:46,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-25 23:47:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:46,406 INFO L225 Difference]: With dead ends: 152 [2022-11-25 23:47:46,406 INFO L226 Difference]: Without dead ends: 102 [2022-11-25 23:47:46,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:47:46,407 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 127 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:46,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 41 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:47:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-25 23:47:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2022-11-25 23:47:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 83 states have internal predecessors, (100), 0 states have call successors, (0), 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-25 23:47:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2022-11-25 23:47:46,417 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 20 [2022-11-25 23:47:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:46,418 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2022-11-25 23:47:46,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-25 23:47:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-11-25 23:47:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:47:46,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:46,419 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:46,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:47:46,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:46,625 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:47:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash -897884767, now seen corresponding path program 1 times [2022-11-25 23:47:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:46,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769837101] [2022-11-25 23:47:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:47:46,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:46,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769837101] [2022-11-25 23:47:46,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769837101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:46,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:47:46,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:47:46,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921741387] [2022-11-25 23:47:46,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:46,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:47:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:46,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:47:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:47:46,697 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:46,746 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-11-25 23:47:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:47:46,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:47:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:46,747 INFO L225 Difference]: With dead ends: 84 [2022-11-25 23:47:46,747 INFO L226 Difference]: Without dead ends: 83 [2022-11-25 23:47:46,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 23:47:46,748 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:46,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 56 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:47:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-25 23:47:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-25 23:47:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 82 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2022-11-25 23:47:46,757 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 23 [2022-11-25 23:47:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:46,758 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2022-11-25 23:47:46,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-11-25 23:47:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:47:46,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:46,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:46,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:47:46,759 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:47:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:46,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2064623907, now seen corresponding path program 1 times [2022-11-25 23:47:46,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:46,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182941379] [2022-11-25 23:47:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:46,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:47:46,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:46,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182941379] [2022-11-25 23:47:46,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182941379] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:46,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607827640] [2022-11-25 23:47:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:46,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:46,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:46,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:47:46,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:47:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:46,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:47:46,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:47:47,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:47:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:47:47,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607827640] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:47:47,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [185895750] [2022-11-25 23:47:47,103 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-25 23:47:47,103 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:47:47,104 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:47:47,104 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:47:47,104 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:47:47,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:47,174 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:47:47,175 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-25 23:47:47,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:47,199 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-25 23:47:47,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:47,319 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-25 23:47:47,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:47,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:47,485 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-25 23:47:47,573 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:47:48,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:48,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:48,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:48,107 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 23:47:48,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 615 treesize of output 585 [2022-11-25 23:47:48,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:48,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:48,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:48,428 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 23:47:48,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 21 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 16 case distinctions, treesize of input 625 treesize of output 607 [2022-11-25 23:47:48,565 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-25 23:47:48,584 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-25 23:47:48,895 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:47:51,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [185895750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:51,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:47:51,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 6, 6] total 24 [2022-11-25 23:47:51,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349255602] [2022-11-25 23:47:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:51,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:47:51,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:51,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:47:51,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:47:51,697 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:54,312 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2022-11-25 23:47:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:47:54,315 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 23:47:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:54,315 INFO L225 Difference]: With dead ends: 136 [2022-11-25 23:47:54,315 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 23:47:54,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:47:54,317 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 94 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:54,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 47 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:47:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 23:47:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2022-11-25 23:47:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.360655737704918) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 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-25 23:47:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-11-25 23:47:54,327 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 24 [2022-11-25 23:47:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:54,327 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-11-25 23:47:54,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-11-25 23:47:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:47:54,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:54,328 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-25 23:47:54,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 23:47:54,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 23:47:54,534 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:47:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:54,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1747968747, now seen corresponding path program 1 times [2022-11-25 23:47:54,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:54,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305786742] [2022-11-25 23:47:54,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:54,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:54,676 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-25 23:47:54,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:54,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305786742] [2022-11-25 23:47:54,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305786742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:54,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578747380] [2022-11-25 23:47:54,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:54,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:54,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:54,679 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:47:54,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:47:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:54,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:47:54,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:54,829 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-25 23:47:54,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:47:54,892 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-25 23:47:54,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578747380] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:47:54,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [72478489] [2022-11-25 23:47:54,897 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-25 23:47:54,897 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:47:54,898 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:47:54,898 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:47:54,898 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:47:54,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:54,959 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-25 23:47:54,959 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-25 23:47:54,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:55,000 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:47:55,000 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-25 23:47:55,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:55,125 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-25 23:47:55,181 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:47:55,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:55,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:55,337 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-25 23:47:55,427 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:47:55,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:55,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:55,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:55,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:55,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:55,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:55,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:55,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:55,952 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 23:47:55,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 651 treesize of output 621 [2022-11-25 23:47:56,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:56,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:56,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:56,285 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 23:47:56,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 21 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 16 case distinctions, treesize of input 661 treesize of output 643 [2022-11-25 23:47:56,514 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-25 23:47:56,555 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-25 23:47:56,653 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-25 23:47:56,667 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-25 23:47:56,947 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:47:58,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [72478489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:58,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:47:58,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 6, 6] total 25 [2022-11-25 23:47:58,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943737438] [2022-11-25 23:47:58,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:58,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:47:58,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:58,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:47:58,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:47:58,943 INFO L87 Difference]: Start difference. First operand 74 states and 83 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-25 23:48:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:02,560 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-11-25 23:48:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:48:02,561 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-25 23:48:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:02,561 INFO L225 Difference]: With dead ends: 119 [2022-11-25 23:48:02,562 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 23:48:02,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=223, Invalid=1037, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 23:48:02,563 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 99 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:02,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 17 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:48:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 23:48:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-11-25 23:48:02,573 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-25 23:48:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-25 23:48:02,574 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 33 [2022-11-25 23:48:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:02,574 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-25 23:48:02,574 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-25 23:48:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-25 23:48:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:48:02,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:02,579 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-25 23:48:02,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:02,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:02,783 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2124968820, now seen corresponding path program 1 times [2022-11-25 23:48:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:02,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139354606] [2022-11-25 23:48:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:02,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:02,911 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-25 23:48:02,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:02,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139354606] [2022-11-25 23:48:02,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139354606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:02,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935513318] [2022-11-25 23:48:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:02,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:02,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:02,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:02,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:48:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:02,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:48:02,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:03,073 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-25 23:48:03,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:03,116 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-25 23:48:03,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935513318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:48:03,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1159350037] [2022-11-25 23:48:03,118 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-25 23:48:03,119 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:48:03,119 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:48:03,119 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:48:03,119 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:48:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:03,186 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-25 23:48:03,186 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-25 23:48:03,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:03,262 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:48:03,265 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-25 23:48:03,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:03,394 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-25 23:48:03,461 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:48:03,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:03,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:03,612 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-25 23:48:03,705 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:48:04,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:04,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:04,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:04,271 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 23:48:04,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 651 treesize of output 621 [2022-11-25 23:48:04,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:04,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:04,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:04,581 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 23:48:04,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 21 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 16 case distinctions, treesize of input 661 treesize of output 643 [2022-11-25 23:48:04,776 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-25 23:48:04,820 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-25 23:48:04,911 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-25 23:48:04,934 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-25 23:48:05,554 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:48:07,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1159350037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:07,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:48:07,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 6, 6] total 30 [2022-11-25 23:48:07,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756810184] [2022-11-25 23:48:07,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:07,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 23:48:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:07,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 23:48:07,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:48:07,902 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-25 23:48:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:13,804 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-11-25 23:48:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:48:13,804 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-25 23:48:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:13,805 INFO L225 Difference]: With dead ends: 67 [2022-11-25 23:48:13,805 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 23:48:13,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 75 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=398, Invalid=1764, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 23:48:13,807 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:13,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:48:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 23:48:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-11-25 23:48:13,817 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-25 23:48:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-11-25 23:48:13,818 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 36 [2022-11-25 23:48:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:13,818 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-11-25 23:48:13,818 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-25 23:48:13,818 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-11-25 23:48:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 23:48:13,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:13,819 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-25 23:48:13,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:14,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:48:14,023 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1449523844, now seen corresponding path program 1 times [2022-11-25 23:48:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:14,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821718690] [2022-11-25 23:48:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:14,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:14,139 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-25 23:48:14,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:14,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821718690] [2022-11-25 23:48:14,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821718690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:14,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445933256] [2022-11-25 23:48:14,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:14,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:14,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:14,141 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:14,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:48:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:14,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:48:14,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:14,293 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-25 23:48:14,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:14,349 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-25 23:48:14,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445933256] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:48:14,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1575873308] [2022-11-25 23:48:14,352 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-25 23:48:14,352 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:48:14,352 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:48:14,352 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:48:14,353 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:48:14,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:14,415 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:48:14,415 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-25 23:48:14,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:14,439 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-25 23:48:14,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:14,539 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-25 23:48:14,613 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:48:14,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:14,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:14,753 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-25 23:48:14,810 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:48:15,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:15,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:15,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:15,399 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 23:48:15,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 651 treesize of output 621 [2022-11-25 23:48:15,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:15,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:15,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:15,755 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 23:48:15,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 21 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 16 case distinctions, treesize of input 661 treesize of output 643 [2022-11-25 23:48:15,950 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-25 23:48:15,995 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-25 23:48:16,071 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-25 23:48:16,090 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-25 23:48:16,576 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:48:19,196 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3635#(and (<= 0 |#NULL.base|) (<= 0 |ULTIMATE.start_main_~#volArray~0#1.offset|) (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (<= |#NULL.offset| 0) (<= ~CELLCOUNT~0 2147483647) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 1 ~CELLCOUNT~0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< 2147483646 |ULTIMATE.start_main_#t~post7#1|) (<= |ULTIMATE.start_main_~MINVAL~0#1| 2) (<= |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.base| 0) (<= |ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#volArray~0#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 2 |ULTIMATE.start_main_~MINVAL~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))' at error location [2022-11-25 23:48:19,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:48:19,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:48:19,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2022-11-25 23:48:19,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437891571] [2022-11-25 23:48:19,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:48:19,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:48:19,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:19,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:48:19,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2022-11-25 23:48:19,199 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-25 23:48:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:19,557 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-11-25 23:48:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:48:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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) Word has length 37 [2022-11-25 23:48:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:19,558 INFO L225 Difference]: With dead ends: 154 [2022-11-25 23:48:19,559 INFO L226 Difference]: Without dead ends: 98 [2022-11-25 23:48:19,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=210, Invalid=1430, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 23:48:19,560 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 154 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:19,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 67 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:48:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-25 23:48:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2022-11-25 23:48:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 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-25 23:48:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-25 23:48:19,571 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 37 [2022-11-25 23:48:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:19,571 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-25 23:48:19,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-25 23:48:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-25 23:48:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 23:48:19,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:19,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:19,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:19,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:48:19,778 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash -512885361, now seen corresponding path program 2 times [2022-11-25 23:48:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:19,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776001243] [2022-11-25 23:48:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 23:48:19,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:19,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776001243] [2022-11-25 23:48:19,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776001243] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:19,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369862596] [2022-11-25 23:48:19,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:48:19,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:19,922 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:19,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:48:19,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 23:48:19,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:48:19,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:48:19,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-25 23:48:20,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-25 23:48:20,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369862596] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:48:20,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [287603555] [2022-11-25 23:48:20,170 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-25 23:48:20,171 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:48:20,171 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:48:20,171 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:48:20,171 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:48:20,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,235 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-25 23:48:20,236 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-25 23:48:20,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,279 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:48:20,279 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-25 23:48:20,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,392 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-25 23:48:20,448 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:48:20,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:20,591 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-25 23:48:20,689 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:48:21,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:21,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:21,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:21,135 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 23:48:21,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 651 treesize of output 621 [2022-11-25 23:48:21,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:21,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:48:21,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:48:21,467 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 23:48:21,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 21 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 16 case distinctions, treesize of input 661 treesize of output 643 [2022-11-25 23:48:21,663 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-25 23:48:21,710 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-25 23:48:21,780 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-25 23:48:21,796 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-25 23:48:22,265 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:48:24,838 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4244#(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-25 23:48:24,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:48:24,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:48:24,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 2, 2] total 9 [2022-11-25 23:48:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481949866] [2022-11-25 23:48:24,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:48:24,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:48:24,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:24,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:48:24,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:48:24,841 INFO L87 Difference]: Start difference. First operand 83 states and 88 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-25 23:48:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:25,061 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-11-25 23:48:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:48:25,062 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 49 [2022-11-25 23:48:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:25,062 INFO L225 Difference]: With dead ends: 86 [2022-11-25 23:48:25,063 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 23:48:25,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 115 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 23:48:25,064 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:25,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 51 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:48:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 23:48:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-25 23:48:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 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-25 23:48:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-11-25 23:48:25,075 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 49 [2022-11-25 23:48:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:25,075 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-11-25 23:48:25,075 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-25 23:48:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-11-25 23:48:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 23:48:25,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:25,076 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:25,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:25,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:48:25,277 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1813275907, now seen corresponding path program 1 times [2022-11-25 23:48:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:25,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656437076] [2022-11-25 23:48:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 23:48:25,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:25,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656437076] [2022-11-25 23:48:25,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656437076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:25,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:25,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:48:25,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199147427] [2022-11-25 23:48:25,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:25,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:48:25,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:25,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:48:25,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:25,348 INFO L87 Difference]: Start difference. First operand 72 states and 76 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-25 23:48:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:25,384 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-11-25 23:48:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:48:25,384 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 52 [2022-11-25 23:48:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:25,385 INFO L225 Difference]: With dead ends: 72 [2022-11-25 23:48:25,385 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 23:48:25,385 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-25 23:48:25,387 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-25 23:48:25,388 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-25 23:48:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 23:48:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-25 23:48:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 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-25 23:48:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-11-25 23:48:25,399 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 52 [2022-11-25 23:48:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:25,399 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-11-25 23:48:25,399 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-25 23:48:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-11-25 23:48:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 23:48:25,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:25,405 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-25 23:48:25,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 23:48:25,405 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-25 23:48:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1028153870, now seen corresponding path program 1 times [2022-11-25 23:48:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:25,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620214951] [2022-11-25 23:48:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:25,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-25 23:48:25,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:25,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620214951] [2022-11-25 23:48:25,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620214951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:25,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:25,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:25,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911149472] [2022-11-25 23:48:25,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:25,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:25,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:25,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:25,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:25,523 INFO L87 Difference]: Start difference. First operand 70 states and 74 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-25 23:48:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:25,561 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-11-25 23:48:25,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:25,562 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 69 [2022-11-25 23:48:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:25,562 INFO L225 Difference]: With dead ends: 70 [2022-11-25 23:48:25,562 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:48:25,565 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-25 23:48:25,566 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-25 23:48:25,567 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-25 23:48:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:48:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:48:25,568 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-25 23:48:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:48:25,568 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-11-25 23:48:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:25,569 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:48:25,569 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-25 23:48:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:48:25,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:48:25,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-11-25 23:48:25,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-11-25 23:48:25,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-11-25 23:48:25,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-11-25 23:48:25,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-11-25 23:48:25,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-11-25 23:48:25,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-11-25 23:48:25,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-11-25 23:48:25,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-11-25 23:48:25,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-11-25 23:48:25,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-11-25 23:48:25,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-11-25 23:48:25,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-11-25 23:48:25,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-11-25 23:48:25,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-11-25 23:48:25,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-11-25 23:48:25,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:48:25,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:48:27,090 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:48:27,090 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-11-25 23:48:27,090 INFO L899 garLoopResultBuilder]: For program point L27-2(lines 27 40) no Hoare annotation was computed. [2022-11-25 23:48:27,090 INFO L899 garLoopResultBuilder]: For program point L27-5(line 27) no Hoare annotation was computed. [2022-11-25 23:48:27,090 INFO L899 garLoopResultBuilder]: For program point L27-6(line 27) no Hoare annotation was computed. [2022-11-25 23:48:27,093 INFO L895 garLoopResultBuilder]: At program point L27-7(lines 27 40) the Hoare annotation is: (let ((.cse29 (select |#memory_int| 1)) (.cse27 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse28 (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 .cse28 5) 0)) (.cse4 (= 114 (select .cse28 1))) (.cse5 (<= 2 ~CELLCOUNT~0)) (.cse6 (= 2 (select |#length| 1))) (.cse7 (= (select |#valid| 3) 1)) (.cse8 (= 2 |ULTIMATE.start_main_~MINVAL~0#1|)) (.cse9 (<= ~CELLCOUNT~0 2147483647)) (.cse10 (= |ULTIMATE.start_main_~#volArray~0#1.offset| 0)) (.cse11 (= 51 (select .cse28 2))) (.cse12 (= (select |#valid| 1) 1)) (.cse13 (= (select .cse28 4) 99)) (.cse14 (= (select .cse28 0) 110)) (.cse15 (or (and .cse27 (= (ite (= (let ((.cse30 (mod ~CELLCOUNT~0 3))) (ite (and (not (= .cse30 0)) (< ~CELLCOUNT~0 0)) (+ .cse30 (- 3)) .cse30)) 0) 1 0) |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| |ULTIMATE.start_assume_abort_if_not_~cond#1|) (not (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| 1)))) (.cse16 (= (select |#valid| 0) 0)) (.cse17 (not (= |ULTIMATE.start_main_~#volArray~0#1.base| 3))) (.cse18 (= (select |#valid| 2) 1)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= (select .cse29 0) 48)) (.cse21 (= (select .cse29 1) 0)) (.cse22 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse23 (= 46 (select .cse28 3))) (.cse24 (= 6 (select |#length| 2))) (.cse25 (< 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0))) (or (and (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 3) 3)) .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 (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse21 .cse22 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2022-11-25 23:48:27,094 INFO L899 garLoopResultBuilder]: For program point L27-8(lines 27 40) no Hoare annotation was computed. [2022-11-25 23:48:27,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2022-11-25 23:48:27,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-25 23:48:27,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-25 23:48:27,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:48:27,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-25 23:48:27,095 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-11-25 23:48:27,095 INFO L899 garLoopResultBuilder]: For program point L37-1(line 37) no Hoare annotation was computed. [2022-11-25 23:48:27,095 INFO L899 garLoopResultBuilder]: For program point L37-2(line 37) no Hoare annotation was computed. [2022-11-25 23:48:27,095 INFO L899 garLoopResultBuilder]: For program point L37-3(line 37) no Hoare annotation was computed. [2022-11-25 23:48:27,095 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-25 23:48:27,095 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 39) no Hoare annotation was computed. [2022-11-25 23:48:27,095 INFO L899 garLoopResultBuilder]: For program point L29-3(line 29) no Hoare annotation was computed. [2022-11-25 23:48:27,095 INFO L899 garLoopResultBuilder]: For program point L29-4(line 29) no Hoare annotation was computed. [2022-11-25 23:48:27,096 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 (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 3) 3)) (= (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) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= 114 (select .cse0 1)) (<= 2 ~CELLCOUNT~0) (= 2 (select |#length| 1)) (<= |ULTIMATE.start_main_~j~0#1| 3) (= (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|) (= 51 (select .cse0 2)) (= (select |#valid| 1) 1) (= (select .cse0 4) 99) (= (select .cse0 0) 110) (= (select |#valid| 0) 0) (not (= |ULTIMATE.start_main_~#volArray~0#1.base| 3)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse1 0) 48) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_main_~i~0#1| 715827882) (= (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-25 23:48:27,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-25 23:48:27,096 INFO L902 garLoopResultBuilder]: At program point L47(lines 13 48) the Hoare annotation is: true [2022-11-25 23:48:27,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-25 23:48:27,096 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 38) no Hoare annotation was computed. [2022-11-25 23:48:27,097 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-11-25 23:48:27,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-25 23:48:27,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:48:27,097 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 46) no Hoare annotation was computed. [2022-11-25 23:48:27,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-25 23:48:27,097 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 16 46) no Hoare annotation was computed. [2022-11-25 23:48:27,097 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-11-25 23:48:27,098 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:48:27,098 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-11-25 23:48:27,098 INFO L899 garLoopResultBuilder]: For program point L33-2(line 33) no Hoare annotation was computed. [2022-11-25 23:48:27,098 INFO L899 garLoopResultBuilder]: For program point L33-3(line 33) no Hoare annotation was computed. [2022-11-25 23:48:27,098 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:48:27,098 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-25 23:48:27,098 INFO L899 garLoopResultBuilder]: For program point L42-3(line 42) no Hoare annotation was computed. [2022-11-25 23:48:27,099 INFO L899 garLoopResultBuilder]: For program point L42-4(line 42) no Hoare annotation was computed. [2022-11-25 23:48:27,099 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 (= ~CELLCOUNT~0 (* (div ~CELLCOUNT~0 3) 3)) (= (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) (= 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|) (= 51 (select .cse0 2)) (= (select |#valid| 1) 1) (= (select .cse0 4) 99) (= (select .cse0 0) 110) (= (select |#valid| 0) 0) (not (= |ULTIMATE.start_main_~#volArray~0#1.base| 3)) (= (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-25 23:48:27,099 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:48:27,099 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2022-11-25 23:48:27,100 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-25 23:48:27,103 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:27,105 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:48:27,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:48:27 BoogieIcfgContainer [2022-11-25 23:48:27,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:48:27,155 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:48:27,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:48:27,155 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:48:27,156 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:47:36" (3/4) ... [2022-11-25 23:48:27,159 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:48:27,168 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-25 23:48:27,171 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 23:48:27,172 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 23:48:27,172 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:48:27,172 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:48:27,199 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((CELLCOUNT == CELLCOUNT / 3 * 3 && 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) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= cond) && 51 == unknown-#memory_int-unknown[2][2]) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && ((((i == 1 && (if (if !(CELLCOUNT % 3 == 0) && CELLCOUNT < 0 then CELLCOUNT % 3 + -3 else CELLCOUNT % 3) == 0 then 1 else 0) == \old(cond)) && \old(cond) == cond) && !(cond == 0)) || (2 <= i && j < 1))) && \valid[0] == 0) && !(volArray == 3)) && \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) || (((((((((((((((((((((((((((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) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 51 == unknown-#memory_int-unknown[2][2]) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && ((((i == 1 && (if (if !(CELLCOUNT % 3 == 0) && CELLCOUNT < 0 then CELLCOUNT % 3 + -3 else CELLCOUNT % 3) == 0 then 1 else 0) == \old(cond)) && \old(cond) == cond) && !(cond == 0)) || (2 <= i && j < 1))) && \valid[0] == 0) && !(volArray == 3)) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && 46 == unknown-#memory_int-unknown[2][3]) && 6 == unknown-#length-unknown[2]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-25 23:48:27,199 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((CELLCOUNT == CELLCOUNT / 3 * 3 && 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) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= i) && 0 <= cond) && 51 == unknown-#memory_int-unknown[2][2]) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && !(volArray == 3)) && \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-25 23:48:27,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((CELLCOUNT == CELLCOUNT / 3 * 3 && 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) && 1 <= i) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && j <= 3) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= cond) && 51 == unknown-#memory_int-unknown[2][2]) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && !(volArray == 3)) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && i <= 715827882) && 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-25 23:48:27,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:48:27,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:48:27,218 INFO L158 Benchmark]: Toolchain (without parser) took 51151.20ms. Allocated memory was 151.0MB in the beginning and 247.5MB in the end (delta: 96.5MB). Free memory was 104.0MB in the beginning and 158.9MB in the end (delta: -54.9MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2022-11-25 23:48:27,218 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:48:27,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.05ms. Allocated memory is still 151.0MB. Free memory was 104.0MB in the beginning and 93.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 23:48:27,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.35ms. Allocated memory is still 151.0MB. Free memory was 93.4MB in the beginning and 92.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:48:27,219 INFO L158 Benchmark]: Boogie Preprocessor took 35.44ms. Allocated memory is still 151.0MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:48:27,220 INFO L158 Benchmark]: RCFGBuilder took 528.90ms. Allocated memory is still 151.0MB. Free memory was 89.9MB in the beginning and 73.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:48:27,220 INFO L158 Benchmark]: TraceAbstraction took 50180.90ms. Allocated memory was 151.0MB in the beginning and 247.5MB in the end (delta: 96.5MB). Free memory was 72.6MB in the beginning and 162.0MB in the end (delta: -89.5MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2022-11-25 23:48:27,220 INFO L158 Benchmark]: Witness Printer took 62.80ms. Allocated memory is still 247.5MB. Free memory was 162.0MB in the beginning and 158.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:48:27,222 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.26ms. Allocated memory is still 151.0MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.05ms. Allocated memory is still 151.0MB. Free memory was 104.0MB in the beginning and 93.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.35ms. Allocated memory is still 151.0MB. Free memory was 93.4MB in the beginning and 92.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.44ms. Allocated memory is still 151.0MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.90ms. Allocated memory is still 151.0MB. Free memory was 89.9MB in the beginning and 73.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 50180.90ms. Allocated memory was 151.0MB in the beginning and 247.5MB in the end (delta: 96.5MB). Free memory was 72.6MB in the beginning and 162.0MB in the end (delta: -89.5MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. * Witness Printer took 62.80ms. Allocated memory is still 247.5MB. Free memory was 162.0MB in the beginning and 158.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 50.0s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1089 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1089 mSDsluCounter, 844 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 454 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1557 IncrementalHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 390 mSDtfsCounter, 1557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 724 GetRequests, 432 SyntacticMatches, 62 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2449 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=11, InterpolantAutomatonStates: 132, 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, 19 MinimizatonAttempts, 137 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 21 NumberOfFragments, 716 HoareAnnotationTreeSize, 4 FomulaSimplifications, 236 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 2529 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 640 NumberOfCodeBlocks, 601 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 808 ConstructedInterpolants, 0 QuantifiedInterpolants, 2148 SizeOfPredicates, 18 NumberOfNonLiveVariables, 657 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 31 InterpolantComputations, 13 PerfectInterpolantSequences, 383/438 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: 8.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 112, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 432, TOOLS_POST_TIME: 6.8s, 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: 372, TOOLS_QUANTIFIERELIM_TIME: 6.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 594, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 40, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 10, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 27, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 112, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 17, LOOP_SUMMARIZER_CACHE_MISSES: 17, LOOP_SUMMARIZER_OVERALL_TIME: 5.3s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 5.3s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 27, 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: 3598, DAG_COMPRESSION_RETAINED_NODES: 335, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((CELLCOUNT == CELLCOUNT / 3 * 3 && 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) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= i) && 0 <= cond) && 51 == unknown-#memory_int-unknown[2][2]) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && !(volArray == 3)) && \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: (((((((((((((((((((((((((((((((((CELLCOUNT == CELLCOUNT / 3 * 3 && 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) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= cond) && 51 == unknown-#memory_int-unknown[2][2]) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && ((((i == 1 && (if (if !(CELLCOUNT % 3 == 0) && CELLCOUNT < 0 then CELLCOUNT % 3 + -3 else CELLCOUNT % 3) == 0 then 1 else 0) == \old(cond)) && \old(cond) == cond) && !(cond == 0)) || (2 <= i && j < 1))) && \valid[0] == 0) && !(volArray == 3)) && \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) || (((((((((((((((((((((((((((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) && 2 == unknown-#length-unknown[1]) && i == 1) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 51 == unknown-#memory_int-unknown[2][2]) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && ((((i == 1 && (if (if !(CELLCOUNT % 3 == 0) && CELLCOUNT < 0 then CELLCOUNT % 3 + -3 else CELLCOUNT % 3) == 0 then 1 else 0) == \old(cond)) && \old(cond) == cond) && !(cond == 0)) || (2 <= i && j < 1))) && \valid[0] == 0) && !(volArray == 3)) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && unknown-#StackHeapBarrier-unknown < volArray) && 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: (((((((((((((((((((((((((((((((((CELLCOUNT == CELLCOUNT / 3 * 3 && 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) && 1 <= i) && 114 == unknown-#memory_int-unknown[2][1]) && 2 <= CELLCOUNT) && 2 == unknown-#length-unknown[1]) && j <= 3) && \valid[3] == 1) && 2 == MINVAL) && CELLCOUNT <= 2147483647) && volArray == 0) && 0 <= \old(cond)) && 0 <= cond) && 51 == unknown-#memory_int-unknown[2][2]) && \valid[1] == 1) && unknown-#memory_int-unknown[2][4] == 99) && unknown-#memory_int-unknown[2][0] == 110) && \valid[0] == 0) && !(volArray == 3)) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && \old(cond) <= 1) && i <= 715827882) && 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-25 23:48:27,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41550e71-92c7-424c-9f60-1db43cfe4f4f/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