./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --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_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/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_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/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_da94fac7-951d-43f0-bcaf-1f242f200806/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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- 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:49:23,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:49:23,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:49:23,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:49:23,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:49:23,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:49:23,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:49:23,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:49:23,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:49:23,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:49:23,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:49:23,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:49:23,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:49:23,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:49:23,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:49:23,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:49:23,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:49:23,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:49:23,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:49:23,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:49:23,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:49:23,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:49:23,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:49:23,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:49:23,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:49:23,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:49:23,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:49:23,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:49:23,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:49:23,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:49:23,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:49:23,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:49:23,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:49:23,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:49:23,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:49:23,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:49:23,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:49:23,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:49:23,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:49:23,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:49:23,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:49:23,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:49:23,689 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:49:23,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:49:23,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:49:23,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:49:23,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:49:23,693 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:49:23,693 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:49:23,693 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:49:23,694 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:49:23,694 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:49:23,695 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:49:23,696 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:49:23,696 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:49:23,697 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:49:23,697 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:49:23,697 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:49:23,698 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:49:23,698 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:49:23,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:49:23,700 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:49:23,700 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:49:23,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:49:23,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:49:23,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:49:23,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:49:23,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:49:23,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:49:23,703 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:49:23,703 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:49:23,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:49:23,704 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:49:23,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:49:23,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:49:23,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:49:23,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:49:23,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:49:23,706 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:49:23,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:49:23,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:49:23,707 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:49:23,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:49:23,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:49:23,708 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:49:23,708 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_da94fac7-951d-43f0-bcaf-1f242f200806/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_da94fac7-951d-43f0-bcaf-1f242f200806/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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-11-25 23:49:24,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:49:24,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:49:24,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:49:24,119 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:49:24,120 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:49:24,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-25 23:49:27,951 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:49:28,328 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:49:28,328 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-25 23:49:28,351 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/data/ebdd4975a/76b4c30f1a5a4001adb818e9d3bd9754/FLAG46736bd04 [2022-11-25 23:49:28,369 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/data/ebdd4975a/76b4c30f1a5a4001adb818e9d3bd9754 [2022-11-25 23:49:28,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:49:28,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:49:28,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:49:28,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:49:28,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:49:28,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:28,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f10a9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28, skipping insertion in model container [2022-11-25 23:49:28,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:28,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:49:28,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:49:28,810 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_da94fac7-951d-43f0-bcaf-1f242f200806/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-25 23:49:28,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:49:28,824 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:49:28,878 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-25 23:49:28,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:49:28,912 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:49:28,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28 WrapperNode [2022-11-25 23:49:28,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:49:28,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:49:28,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:49:28,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:49:28,924 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:49:28" (1/1) ... [2022-11-25 23:49:28,941 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:49:28" (1/1) ... [2022-11-25 23:49:28,972 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2022-11-25 23:49:28,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:49:28,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:49:28,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:49:28,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:49:28,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:28,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:28,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:28,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:28,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:29,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:29,007 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:29,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:29,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:49:29,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:49:29,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:49:29,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:49:29,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28" (1/1) ... [2022-11-25 23:49:29,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:49:29,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:49:29,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:49:29,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:49:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:49:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:49:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:49:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:49:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:49:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:49:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:49:29,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:49:29,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:49:29,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:49:29,352 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:49:29,355 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:49:29,715 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:49:29,800 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:49:29,800 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-25 23:49:29,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:49:29 BoogieIcfgContainer [2022-11-25 23:49:29,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:49:29,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:49:29,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:49:29,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:49:29,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:49:28" (1/3) ... [2022-11-25 23:49:29,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dbae04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:49:29, skipping insertion in model container [2022-11-25 23:49:29,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:49:28" (2/3) ... [2022-11-25 23:49:29,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dbae04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:49:29, skipping insertion in model container [2022-11-25 23:49:29,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:49:29" (3/3) ... [2022-11-25 23:49:29,817 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-25 23:49:29,843 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:49:29,843 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-25 23:49:29,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:49:29,914 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;@1effe873, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:49:29,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-25 23:49:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.896551724137931) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:49:29,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:29,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:49:29,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:29,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash 181817, now seen corresponding path program 1 times [2022-11-25 23:49:29,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:29,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138417344] [2022-11-25 23:49:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:30,334 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:49:30,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:30,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138417344] [2022-11-25 23:49:30,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138417344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:30,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:30,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:49:30,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389347578] [2022-11-25 23:49:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:30,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:49:30,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:30,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:49:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:49:30,411 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.896551724137931) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:49:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:30,520 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2022-11-25 23:49:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:49:30,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-25 23:49:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:30,533 INFO L225 Difference]: With dead ends: 95 [2022-11-25 23:49:30,534 INFO L226 Difference]: Without dead ends: 50 [2022-11-25 23:49:30,538 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:49:30,542 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:30,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:49:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-25 23:49:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-11-25 23:49:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-25 23:49:30,590 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 3 [2022-11-25 23:49:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:30,591 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-25 23:49:30,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:49:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-25 23:49:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:49:30,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:30,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:49:30,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:49:30,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:30,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:30,593 INFO L85 PathProgramCache]: Analyzing trace with hash 5496013, now seen corresponding path program 1 times [2022-11-25 23:49:30,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:30,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573505650] [2022-11-25 23:49:30,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:30,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:30,775 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:49:30,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:30,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573505650] [2022-11-25 23:49:30,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573505650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:30,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:30,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:49:30,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226022073] [2022-11-25 23:49:30,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:30,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:49:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:49:30,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:49:30,781 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. 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:49:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:30,838 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-25 23:49:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:49:30,839 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:49:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:30,840 INFO L225 Difference]: With dead ends: 45 [2022-11-25 23:49:30,840 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 23:49:30,841 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:49:30,843 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:30,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:49:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 23:49:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-25 23:49:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-25 23:49:30,857 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 4 [2022-11-25 23:49:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:30,858 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-25 23:49:30,860 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:49:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-25 23:49:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:49:30,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:30,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:49:30,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:49:30,863 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 170376459, now seen corresponding path program 1 times [2022-11-25 23:49:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:30,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908442244] [2022-11-25 23:49:30,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:30,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:31,087 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:49:31,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:31,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908442244] [2022-11-25 23:49:31,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908442244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:31,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:31,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:49:31,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149392727] [2022-11-25 23:49:31,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:31,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:49:31,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:31,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:49:31,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:49:31,091 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:49:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:31,137 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-25 23:49:31,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:49:31,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:49:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:31,140 INFO L225 Difference]: With dead ends: 44 [2022-11-25 23:49:31,140 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 23:49:31,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:49:31,142 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:31,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 72 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:49:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 23:49:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-25 23:49:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 42 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:49:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-25 23:49:31,157 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 5 [2022-11-25 23:49:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:31,157 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-25 23:49:31,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:49:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-25 23:49:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:49:31,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:31,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:31,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:49:31,160 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:31,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:31,161 INFO L85 PathProgramCache]: Analyzing trace with hash 523025805, now seen corresponding path program 1 times [2022-11-25 23:49:31,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:31,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218077617] [2022-11-25 23:49:31,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:31,261 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:49:31,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:31,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218077617] [2022-11-25 23:49:31,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218077617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:31,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:31,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:49:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783887924] [2022-11-25 23:49:31,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:31,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:49:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:49:31,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:49:31,265 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:49:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:31,347 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-25 23:49:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:49:31,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-25 23:49:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:31,349 INFO L225 Difference]: With dead ends: 43 [2022-11-25 23:49:31,349 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 23:49:31,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:49:31,351 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:31,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 23 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:49:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 23:49:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-25 23:49:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-11-25 23:49:31,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 7 [2022-11-25 23:49:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:31,375 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-11-25 23:49:31,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:49:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-11-25 23:49:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:49:31,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:31,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:31,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:49:31,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:31,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash -966069163, now seen corresponding path program 1 times [2022-11-25 23:49:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:31,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318611253] [2022-11-25 23:49:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:31,475 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:49:31,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:31,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318611253] [2022-11-25 23:49:31,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318611253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:31,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:31,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:49:31,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905422654] [2022-11-25 23:49:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:31,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:49:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:49:31,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:49:31,484 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:31,555 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-11-25 23:49:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:49:31,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:49:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:31,557 INFO L225 Difference]: With dead ends: 41 [2022-11-25 23:49:31,557 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 23:49:31,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:49:31,560 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:31,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:49:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 23:49:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-25 23:49:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 38 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:49:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-25 23:49:31,568 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 8 [2022-11-25 23:49:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:31,569 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-25 23:49:31,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-25 23:49:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:49:31,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:31,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:31,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:49:31,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:31,572 INFO L85 PathProgramCache]: Analyzing trace with hash -679527337, now seen corresponding path program 1 times [2022-11-25 23:49:31,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:31,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151939757] [2022-11-25 23:49:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:31,676 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:49:31,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:31,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151939757] [2022-11-25 23:49:31,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151939757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:31,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:31,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:49:31,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234815385] [2022-11-25 23:49:31,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:31,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:49:31,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:31,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:49:31,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:49:31,680 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:49:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:31,802 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-11-25 23:49:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:49:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-25 23:49:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:31,809 INFO L225 Difference]: With dead ends: 43 [2022-11-25 23:49:31,809 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 23:49:31,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:49:31,819 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:31,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:49:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 23:49:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-11-25 23:49:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 36 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:49:31,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-11-25 23:49:31,841 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 10 [2022-11-25 23:49:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:31,842 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-25 23:49:31,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:49:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-11-25 23:49:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:49:31,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:31,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:31,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:49:31,845 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:31,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:31,847 INFO L85 PathProgramCache]: Analyzing trace with hash 409489111, now seen corresponding path program 1 times [2022-11-25 23:49:31,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:31,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694182221] [2022-11-25 23:49:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:31,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:31,984 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:49:31,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:31,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694182221] [2022-11-25 23:49:31,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694182221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:31,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:31,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:49:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838972932] [2022-11-25 23:49:31,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:31,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:49:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:31,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:49:31,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:49:31,993 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:49:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:32,092 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-11-25 23:49:32,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:49:32,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:49:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:32,094 INFO L225 Difference]: With dead ends: 64 [2022-11-25 23:49:32,095 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 23:49:32,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:49:32,102 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 86 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:32,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 40 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:49:32,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 23:49:32,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2022-11-25 23:49:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-11-25 23:49:32,125 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2022-11-25 23:49:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:32,126 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-11-25 23:49:32,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:49:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-11-25 23:49:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:49:32,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:32,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:32,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:49:32,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:32,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1617949353, now seen corresponding path program 1 times [2022-11-25 23:49:32,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:32,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700922613] [2022-11-25 23:49:32,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:32,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:49:32,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:32,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700922613] [2022-11-25 23:49:32,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700922613] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:49:32,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096013362] [2022-11-25 23:49:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:32,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:49:32,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:49:32,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:49:32,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:49:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:32,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:49:32,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:49:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:49:32,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:49:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:49:32,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096013362] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:49:32,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [253294864] [2022-11-25 23:49:32,699 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-25 23:49:32,700 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:49:32,711 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:49:32,718 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:49:32,719 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:49:32,915 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:49:32,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:49:32,994 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:49:32,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:49:33,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:33,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:33,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:33,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:49:33,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:33,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:33,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:49:33,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:33,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:33,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:49:33,519 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:49:33,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-25 23:49:33,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:49:33,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:33,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:33,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:33,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:49:33,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:33,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:33,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:49:33,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:33,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:33,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:49:34,410 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-25 23:49:34,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-25 23:49:34,585 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-25 23:49:34,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-25 23:49:35,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:35,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:35,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:35,345 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-25 23:49:35,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-25 23:49:35,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:35,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:35,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:35,454 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-25 23:49:35,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-25 23:49:35,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:35,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:35,523 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 23:49:35,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 426 treesize of output 391 [2022-11-25 23:49:35,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:35,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:35,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:35,630 INFO L321 Elim1Store]: treesize reduction 102, result has 21.5 percent of original size [2022-11-25 23:49:35,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 442 treesize of output 398 [2022-11-25 23:49:35,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:35,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:35,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:35,716 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-25 23:49:35,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 427 treesize of output 416 [2022-11-25 23:49:35,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:35,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:35,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:35,782 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-25 23:49:35,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-25 23:49:36,376 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:49:36,382 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:49:36,386 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:49:36,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:49:36,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:49:36,430 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:49:38,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [253294864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:38,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:49:38,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 11 [2022-11-25 23:49:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590078875] [2022-11-25 23:49:38,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:38,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:49:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:38,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:49:38,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:49:38,790 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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:49:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:39,044 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2022-11-25 23:49:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:49:39,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-25 23:49:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:39,046 INFO L225 Difference]: With dead ends: 95 [2022-11-25 23:49:39,047 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 23:49:39,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:49:39,050 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 89 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:39,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 64 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:49:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 23:49:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2022-11-25 23:49:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.411764705882353) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-25 23:49:39,077 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2022-11-25 23:49:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:39,077 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-25 23:49:39,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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:49:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-25 23:49:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:49:39,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:39,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:39,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:49:39,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:49:39,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1617952775, now seen corresponding path program 1 times [2022-11-25 23:49:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:39,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890917272] [2022-11-25 23:49:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:39,364 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:49:39,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:39,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890917272] [2022-11-25 23:49:39,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890917272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:39,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:39,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:49:39,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872518648] [2022-11-25 23:49:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:39,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:49:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:39,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:49:39,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:49:39,375 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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:49:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:39,413 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-25 23:49:39,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:49:39,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-25 23:49:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:39,415 INFO L225 Difference]: With dead ends: 44 [2022-11-25 23:49:39,416 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 23:49:39,416 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:49:39,419 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:39,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:49:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 23:49:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-25 23:49:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 42 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:49:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-25 23:49:39,433 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2022-11-25 23:49:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:39,433 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-25 23:49:39,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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:49:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-25 23:49:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:49:39,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:39,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:39,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:49:39,435 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1383071618, now seen corresponding path program 1 times [2022-11-25 23:49:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:39,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756211567] [2022-11-25 23:49:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:49:39,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:39,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756211567] [2022-11-25 23:49:39,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756211567] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:49:39,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473115076] [2022-11-25 23:49:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:49:39,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:49:39,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:49:39,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:49:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:39,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:49:39,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:49:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:49:39,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:49:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:49:39,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473115076] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:49:39,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [188727331] [2022-11-25 23:49:39,774 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 23:49:39,775 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:49:39,775 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:49:39,776 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:49:39,776 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:49:39,858 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:49:39,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:49:39,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:49:39,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:39,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:39,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:49:39,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:39,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:39,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:39,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:49:39,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:39,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:39,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:49:40,105 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:49:40,105 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 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-25 23:49:40,191 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:49:40,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-25 23:49:40,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:40,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:40,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:40,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:49:40,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:40,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:40,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:49:40,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:40,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:40,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:49:40,865 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-25 23:49:40,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-25 23:49:40,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:49:41,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:41,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:41,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:41,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-25 23:49:41,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:41,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:41,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:49:41,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:41,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:41,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:49:41,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:49:41,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:49:41,573 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:49:44,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [188727331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:44,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:49:44,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 12 [2022-11-25 23:49:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836209] [2022-11-25 23:49:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:44,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:49:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:44,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:49:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:49:44,014 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:49:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:44,370 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-11-25 23:49:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:49:44,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:49:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:44,372 INFO L225 Difference]: With dead ends: 64 [2022-11-25 23:49:44,372 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 23:49:44,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:49:44,373 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 109 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:44,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 78 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:49:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 23:49:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2022-11-25 23:49:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-25 23:49:44,385 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 14 [2022-11-25 23:49:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:44,385 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-25 23:49:44,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:49:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-25 23:49:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:49:44,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:44,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:44,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 23:49:44,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:49:44,594 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:44,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1986936642, now seen corresponding path program 1 times [2022-11-25 23:49:44,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:44,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985045459] [2022-11-25 23:49:44,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:44,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:49:44,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:44,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985045459] [2022-11-25 23:49:44,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985045459] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:49:44,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958141531] [2022-11-25 23:49:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:44,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:49:44,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:49:44,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:49:44,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:49:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:44,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:49:44,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:49:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:49:44,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:49:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:49:44,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958141531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:49:44,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [265115896] [2022-11-25 23:49:44,928 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-25 23:49:44,929 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:49:44,929 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:49:44,929 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:49:44,929 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:49:44,991 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:49:44,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:49:45,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:49:45,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:45,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:45,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:49:45,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:45,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:45,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:45,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:49:45,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:45,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:45,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:49:45,210 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:49:45,211 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 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-25 23:49:45,300 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:49:45,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-25 23:49:45,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:45,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:45,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:45,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:49:45,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:45,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:45,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:49:45,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:45,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-25 23:49:45,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:45,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 23:49:45,910 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-25 23:49:45,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-25 23:49:45,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:49:46,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:46,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:46,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:46,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-25 23:49:46,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:46,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:46,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:49:46,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:46,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:46,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:49:46,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 15 treesize of output 1 [2022-11-25 23:49:46,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:49:46,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:46,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:49:46,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:49:46,764 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:49:49,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [265115896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:49,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:49:49,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 16 [2022-11-25 23:49:49,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560315110] [2022-11-25 23:49:49,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:49,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:49:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:49,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:49:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:49:49,335 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:50,086 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-25 23:49:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:49:50,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 23:49:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:50,088 INFO L225 Difference]: With dead ends: 63 [2022-11-25 23:49:50,088 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 23:49:50,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:49:50,089 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:50,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 63 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:49:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 23:49:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-11-25 23:49:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.358974358974359) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 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:49:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-25 23:49:50,100 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2022-11-25 23:49:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:50,101 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-25 23:49:50,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-25 23:49:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:49:50,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:50,102 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:50,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:49:50,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 23:49:50,307 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:50,308 INFO L85 PathProgramCache]: Analyzing trace with hash 185122759, now seen corresponding path program 1 times [2022-11-25 23:49:50,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:50,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458404018] [2022-11-25 23:49:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:49:50,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:50,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458404018] [2022-11-25 23:49:50,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458404018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:49:50,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667872894] [2022-11-25 23:49:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:50,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:49:50,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:49:50,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:49:50,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:49:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:50,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:49:50,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:49:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:49:50,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:49:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:49:50,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667872894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:49:50,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533448360] [2022-11-25 23:49:50,588 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 23:49:50,589 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:49:50,590 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:49:50,590 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:49:50,590 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:49:50,644 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:49:50,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:49:50,685 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:49:50,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:49:50,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:50,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:50,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:49:50,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:50,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:50,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:50,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:49:50,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:50,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:50,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:49:50,874 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:49:50,874 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 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-25 23:49:50,936 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:49:50,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-25 23:49:50,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:50,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:51,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:51,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:49:51,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:51,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:51,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:49:51,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:51,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:51,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:49:51,406 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-25 23:49:51,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-25 23:49:51,518 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-25 23:49:51,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 406 [2022-11-25 23:49:51,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:51,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:51,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:51,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:51,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-25 23:49:51,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:51,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:51,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:49:51,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:51,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:51,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:49:52,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:52,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:49:52,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:52,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:52,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:49:52,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:52,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:49:52,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:52,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:52,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:49:52,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:49:52,465 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:49:54,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1533448360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:54,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:49:54,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 4, 4] total 14 [2022-11-25 23:49:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89791499] [2022-11-25 23:49:54,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:54,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:49:54,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:54,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:49:54,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:49:54,552 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:55,879 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-11-25 23:49:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:49:55,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 23:49:55,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:55,880 INFO L225 Difference]: With dead ends: 58 [2022-11-25 23:49:55,880 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 23:49:55,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:49:55,882 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 114 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:55,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 42 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:49:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 23:49:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-11-25 23:49:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 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:49:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-25 23:49:55,892 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2022-11-25 23:49:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:55,893 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-25 23:49:55,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-25 23:49:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:49:55,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:55,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:55,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:49:56,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:49:56,098 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:56,099 INFO L85 PathProgramCache]: Analyzing trace with hash 791559902, now seen corresponding path program 1 times [2022-11-25 23:49:56,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:56,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140632585] [2022-11-25 23:49:56,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:49:56,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:56,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140632585] [2022-11-25 23:49:56,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140632585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:56,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:56,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:49:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197090111] [2022-11-25 23:49:56,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:56,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:49:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:56,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:49:56,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:49:56,168 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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:49:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:56,195 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-11-25 23:49:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:49:56,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-25 23:49:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:56,198 INFO L225 Difference]: With dead ends: 39 [2022-11-25 23:49:56,199 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 23:49:56,199 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:49:56,200 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:56,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:49:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 23:49:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-25 23:49:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 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:49:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-25 23:49:56,211 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2022-11-25 23:49:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:56,211 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-25 23:49:56,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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:49:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-25 23:49:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:49:56,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:56,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:56,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:49:56,213 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:49:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1231385749, now seen corresponding path program 1 times [2022-11-25 23:49:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:56,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658985530] [2022-11-25 23:49:56,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:56,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:49:56,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:56,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658985530] [2022-11-25 23:49:56,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658985530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:49:56,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422039148] [2022-11-25 23:49:56,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:56,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:49:56,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:49:56,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:49:56,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:49:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:56,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:49:56,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:49:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:49:56,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:49:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:49:56,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422039148] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:49:56,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224919961] [2022-11-25 23:49:56,496 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:49:56,496 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:49:56,497 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:49:56,497 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:49:56,497 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:49:56,541 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:49:56,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:49:56,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:49:56,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:56,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:56,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:49:56,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:56,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:56,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:49:56,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:56,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:56,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:56,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:49:56,696 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:49:56,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-25 23:49:56,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:49:56,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:56,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:56,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:56,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:49:56,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:56,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:56,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:49:56,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:56,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:56,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:49:57,157 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-25 23:49:57,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-25 23:49:57,206 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-25 23:49:57,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-25 23:49:57,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:57,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:57,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:57,653 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-25 23:49:57,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-25 23:49:57,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:57,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:57,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:57,714 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-25 23:49:57,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-25 23:49:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:57,767 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 23:49:57,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 426 treesize of output 391 [2022-11-25 23:49:57,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:57,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:57,823 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-25 23:49:57,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 442 treesize of output 398 [2022-11-25 23:49:57,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:57,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:57,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:57,899 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-25 23:49:57,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 427 treesize of output 416 [2022-11-25 23:49:57,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:57,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:57,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:49:57,952 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-25 23:49:57,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-25 23:49:58,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:58,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:49:58,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:58,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:58,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:49:58,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:58,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:49:58,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:58,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:49:58,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:49:58,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:49:58,791 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:01,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1224919961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:01,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:01,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 4, 4] total 17 [2022-11-25 23:50:01,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239214897] [2022-11-25 23:50:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:01,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:50:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:50:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:50:01,377 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:03,570 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-11-25 23:50:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:50:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 23:50:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:03,572 INFO L225 Difference]: With dead ends: 72 [2022-11-25 23:50:03,572 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 23:50:03,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:50:03,573 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:03,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 59 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:50:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 23:50:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2022-11-25 23:50:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-11-25 23:50:03,584 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 26 [2022-11-25 23:50:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:03,584 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-11-25 23:50:03,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-11-25 23:50:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 23:50:03,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:03,585 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:03,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:03,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 23:50:03,790 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:50:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash -647815634, now seen corresponding path program 1 times [2022-11-25 23:50:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:03,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752583957] [2022-11-25 23:50:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:50:03,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:03,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752583957] [2022-11-25 23:50:03,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752583957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:03,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553316037] [2022-11-25 23:50:03,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:03,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:03,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:03,893 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:03,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:50:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:04,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:50:04,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:50:04,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:50:04,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553316037] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:04,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1066339025] [2022-11-25 23:50:04,083 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:50:04,084 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:04,084 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:04,084 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:04,084 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:04,127 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:50:04,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:50:04,165 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:50:04,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:50:04,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:04,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:04,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:04,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:50:04,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:04,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:04,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:50:04,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:04,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:04,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:50:04,339 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:50:04,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-25 23:50:04,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:50:04,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:04,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:04,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:04,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:50:04,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:04,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:04,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:50:04,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:04,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-25 23:50:04,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:04,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 23:50:04,843 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-25 23:50:04,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-25 23:50:04,893 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-25 23:50:04,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-25 23:50:05,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:05,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:05,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,265 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 23:50:05,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 414 treesize of output 379 [2022-11-25 23:50:05,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:05,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,339 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-25 23:50:05,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-25 23:50:05,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:05,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:05,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,405 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-25 23:50:05,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 430 treesize of output 386 [2022-11-25 23:50:05,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:05,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,467 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-25 23:50:05,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 404 [2022-11-25 23:50:05,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,523 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-25 23:50:05,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 407 [2022-11-25 23:50:05,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:05,582 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-25 23:50:05,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 368 [2022-11-25 23:50:06,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:06,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:06,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:06,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:06,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:06,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:06,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:06,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:06,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:06,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:50:06,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:50:06,468 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:09,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1066339025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:09,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:09,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 4, 4] total 18 [2022-11-25 23:50:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039946009] [2022-11-25 23:50:09,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:09,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:50:09,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:09,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:50:09,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:50:09,138 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:11,497 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-11-25 23:50:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 23:50:11,498 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 23:50:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:11,498 INFO L225 Difference]: With dead ends: 57 [2022-11-25 23:50:11,498 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 23:50:11,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 68 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:50:11,499 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 91 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:11,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 45 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 23:50:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2022-11-25 23:50:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-11-25 23:50:11,511 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 32 [2022-11-25 23:50:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:11,511 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-11-25 23:50:11,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-11-25 23:50:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 23:50:11,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:11,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:11,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 23:50:11,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:50:11,718 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:50:11,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:11,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1787300487, now seen corresponding path program 1 times [2022-11-25 23:50:11,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:11,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020255809] [2022-11-25 23:50:11,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:50:11,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:11,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020255809] [2022-11-25 23:50:11,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020255809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:11,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181059512] [2022-11-25 23:50:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:11,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:11,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:11,838 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:11,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:50:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:11,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:50:11,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:50:12,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:50:12,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181059512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:12,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [330148272] [2022-11-25 23:50:12,057 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-25 23:50:12,057 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:12,058 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:12,058 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:12,058 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:12,108 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:50:12,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:50:12,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:50:12,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:12,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:12,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:12,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:50:12,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:12,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:12,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:50:12,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:12,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:50:12,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:12,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:50:12,281 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:50:12,281 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 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-25 23:50:12,354 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:50:12,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-25 23:50:12,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:12,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:12,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:12,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:50:12,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:12,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:12,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:50:12,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:12,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:12,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:50:12,814 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-25 23:50:12,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-25 23:50:12,861 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-25 23:50:12,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-25 23:50:13,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:13,233 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 23:50:13,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 414 treesize of output 379 [2022-11-25 23:50:13,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:13,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:13,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:13,320 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-25 23:50:13,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 404 [2022-11-25 23:50:13,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:13,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:13,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:13,387 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-25 23:50:13,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-25 23:50:13,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:13,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:13,440 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-25 23:50:13,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 430 treesize of output 386 [2022-11-25 23:50:13,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:13,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:13,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:13,501 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-25 23:50:13,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-25 23:50:13,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:13,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:13,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:13,551 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-25 23:50:13,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-25 23:50:14,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:14,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:14,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:14,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:14,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:14,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:14,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:14,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:14,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:14,706 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-25 23:50:14,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-25 23:50:14,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:50:14,787 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:18,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [330148272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:18,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:18,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 4] total 23 [2022-11-25 23:50:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865408472] [2022-11-25 23:50:18,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:18,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:50:18,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:18,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:50:18,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:50:18,396 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:50:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:21,578 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-11-25 23:50:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 23:50:21,580 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 35 [2022-11-25 23:50:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:21,581 INFO L225 Difference]: With dead ends: 75 [2022-11-25 23:50:21,581 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 23:50:21,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 23:50:21,582 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 87 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:21,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 44 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:50:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 23:50:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2022-11-25 23:50:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-11-25 23:50:21,598 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 35 [2022-11-25 23:50:21,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:21,599 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-11-25 23:50:21,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:50:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-11-25 23:50:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 23:50:21,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:21,600 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:21,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:21,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:50:21,807 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:50:21,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:21,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2028801134, now seen corresponding path program 1 times [2022-11-25 23:50:21,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:21,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420940807] [2022-11-25 23:50:21,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:21,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 23:50:21,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:21,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420940807] [2022-11-25 23:50:21,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420940807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:21,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735590159] [2022-11-25 23:50:21,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:21,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:21,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:21,922 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:21,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:50:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:22,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:50:22,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 23:50:22,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 23:50:22,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735590159] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:22,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [723252925] [2022-11-25 23:50:22,128 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-25 23:50:22,128 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:22,128 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:22,129 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:22,129 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:22,180 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:50:22,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:50:22,219 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:50:22,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:50:22,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:22,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:22,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:22,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:50:22,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:22,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:22,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:50:22,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:22,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:50:22,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:22,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:50:22,386 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:50:22,386 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 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-25 23:50:22,450 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:50:22,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-25 23:50:22,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:22,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:22,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:22,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:50:22,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:22,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:22,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:50:22,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:22,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:22,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:50:22,852 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-25 23:50:22,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-25 23:50:22,960 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-25 23:50:22,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 406 [2022-11-25 23:50:23,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:23,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:23,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:23,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:23,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-25 23:50:23,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:23,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:23,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:50:23,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:23,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:23,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:50:23,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:23,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:23,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:23,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:23,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:23,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:23,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:23,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:23,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:24,742 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-25 23:50:24,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-25 23:50:24,788 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-25 23:50:24,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-25 23:50:25,055 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:28,558 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3453#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 3) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (< (+ 2147483647 |ULTIMATE.start_main_#t~post14#1|) 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:50:28,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:50:28,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:28,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-25 23:50:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132813295] [2022-11-25 23:50:28,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:50:28,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:50:28,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:28,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:50:28,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:50:28,561 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:50:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:28,628 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-11-25 23:50:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:50:28,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 42 [2022-11-25 23:50:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:28,629 INFO L225 Difference]: With dead ends: 102 [2022-11-25 23:50:28,629 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 23:50:28,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:50:28,631 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:28,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 23:50:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-25 23:50:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-11-25 23:50:28,647 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 42 [2022-11-25 23:50:28,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:28,647 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-11-25 23:50:28,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:50:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-11-25 23:50:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 23:50:28,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:28,649 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:28,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 23:50:28,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:50:28,855 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:50:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:28,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2032255334, now seen corresponding path program 2 times [2022-11-25 23:50:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:28,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201553704] [2022-11-25 23:50:28,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 23:50:28,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:28,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201553704] [2022-11-25 23:50:28,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201553704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:28,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:28,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:50:28,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957298308] [2022-11-25 23:50:28,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:28,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:50:28,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:28,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:50:28,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:50:28,991 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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:50:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:29,072 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-11-25 23:50:29,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:50:29,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-25 23:50:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:29,073 INFO L225 Difference]: With dead ends: 66 [2022-11-25 23:50:29,074 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:50:29,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:50:29,075 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:29,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 50 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:50:29,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:50:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-11-25 23:50:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 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:50:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-11-25 23:50:29,087 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 46 [2022-11-25 23:50:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:29,087 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-11-25 23:50:29,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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:50:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-11-25 23:50:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 23:50:29,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:29,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:29,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 23:50:29,089 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:50:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2032316264, now seen corresponding path program 1 times [2022-11-25 23:50:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:29,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142996170] [2022-11-25 23:50:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:50:29,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:29,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142996170] [2022-11-25 23:50:29,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142996170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:29,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403109035] [2022-11-25 23:50:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:29,279 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:29,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:50:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:29,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:50:29,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:50:29,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:50:29,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403109035] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:29,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [494091962] [2022-11-25 23:50:29,579 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-25 23:50:29,579 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:29,580 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:29,581 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:29,581 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:29,628 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:50:29,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:50:29,664 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:50:29,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:50:29,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:29,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:29,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:50:29,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:29,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:29,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:29,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:50:29,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:29,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:50:29,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:29,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:50:29,821 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:50:29,821 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 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-25 23:50:29,883 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:50:29,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-25 23:50:29,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:29,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:29,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:29,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:50:29,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:29,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:29,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:50:30,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:30,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:30,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:50:30,344 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-25 23:50:30,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-25 23:50:30,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:50:30,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:30,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:30,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:30,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:50:30,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:30,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:30,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:50:30,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:30,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-25 23:50:30,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:30,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 23:50:30,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:30,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:30,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:31,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:31,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:31,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:31,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:31,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:50:31,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:50:32,127 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-25 23:50:32,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-25 23:50:32,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:50:32,205 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:36,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [494091962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:36,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:36,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [7, 6, 6] total 23 [2022-11-25 23:50:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941226367] [2022-11-25 23:50:36,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:36,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:50:36,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:36,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:50:36,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:50:36,553 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:39,243 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-11-25 23:50:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:50:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-25 23:50:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:39,245 INFO L225 Difference]: With dead ends: 55 [2022-11-25 23:50:39,245 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:50:39,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 106 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 23:50:39,247 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:39,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:50:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:50:39,248 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:50:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:50:39,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2022-11-25 23:50:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:39,248 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:50:39,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:50:39,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:50:39,252 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-11-25 23:50:39,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-11-25 23:50:39,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-11-25 23:50:39,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-11-25 23:50:39,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-11-25 23:50:39,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-11-25 23:50:39,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-11-25 23:50:39,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-11-25 23:50:39,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-11-25 23:50:39,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-11-25 23:50:39,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-11-25 23:50:39,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-11-25 23:50:39,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-11-25 23:50:39,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-11-25 23:50:39,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-11-25 23:50:39,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-11-25 23:50:39,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-11-25 23:50:39,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-11-25 23:50:39,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:39,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:39,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:50:43,772 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-25 23:50:43,773 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-25 23:50:43,773 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-25 23:50:43,773 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2022-11-25 23:50:43,774 INFO L899 garLoopResultBuilder]: For program point L622-4(line 622) no Hoare annotation was computed. [2022-11-25 23:50:43,774 INFO L899 garLoopResultBuilder]: For program point L622-5(line 622) no Hoare annotation was computed. [2022-11-25 23:50:43,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-25 23:50:43,774 INFO L895 garLoopResultBuilder]: At program point L622-6(lines 622 627) the Hoare annotation is: (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (let ((.cse0 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |#NULL.offset| 0))) (or (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse0 .cse1 .cse2))) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-25 23:50:43,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-25 23:50:43,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:50:43,774 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-11-25 23:50:43,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-25 23:50:43,775 INFO L899 garLoopResultBuilder]: For program point L623(line 623) no Hoare annotation was computed. [2022-11-25 23:50:43,775 INFO L899 garLoopResultBuilder]: For program point L623-1(line 623) no Hoare annotation was computed. [2022-11-25 23:50:43,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-25 23:50:43,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-25 23:50:43,775 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_sll_update_at_~index#1| 1)) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (let ((.cse0 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |#NULL.offset| 0))) (or (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse0 .cse1 .cse2))) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 2 |ULTIMATE.start_sll_update_at_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_update_at_~data#1| 3) (<= |ULTIMATE.start_sll_update_at_~index#1| 1) (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= 2 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 2 |ULTIMATE.start_sll_update_at_#in~data#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-25 23:50:43,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-25 23:50:43,776 INFO L895 garLoopResultBuilder]: At program point L624(lines 624 626) the Hoare annotation is: (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_#t~ret15#1|) (<= 0 (+ |ULTIMATE.start_main_#t~ret15#1| 2147483648)) (let ((.cse0 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse2 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse3 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|)) (.cse5 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse7 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse8 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse9 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse10 (<= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse4 (+ |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 4))) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse4)) .cse5 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| (+ |ULTIMATE.start_sll_get_data_at_~index#1| 1)) .cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse4) |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse7 .cse8 .cse9 (< 0 |ULTIMATE.start_sll_get_data_at_#in~index#1|) .cse10)) (and (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 .cse9 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse10))) (<= |ULTIMATE.start_main_#t~ret15#1| 2147483647) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (let ((.cse11 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (= |#NULL.offset| 0)) (.cse14 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse11 .cse12 .cse13 .cse14) (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse11 .cse12 .cse13 .cse14))) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (< 0 |ULTIMATE.start_sll_get_data_at_~index#1|)) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) [2022-11-25 23:50:43,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-25 23:50:43,777 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~len#1| 0) (let ((.cse0 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse1 (= .cse4 |ULTIMATE.start_main_~expected~0#1|)) (.cse3 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (or (let ((.cse2 (+ |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 4))) (and .cse0 .cse1 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse2)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| (+ |ULTIMATE.start_sll_get_data_at_~index#1| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse2) |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse3 (< 0 |ULTIMATE.start_sll_get_data_at_#in~index#1|))) (and (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) .cse0 .cse1 .cse3 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|)))) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= 2 .cse4) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (let ((.cse5 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |#NULL.offset| 0)) (.cse8 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse5 .cse6 .cse7 .cse8))) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) [2022-11-25 23:50:43,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-25 23:50:43,777 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2022-11-25 23:50:43,777 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~len#1|) (let ((.cse0 (<= 1 |ULTIMATE.start_node_create_~data#1|)) (.cse1 (<= |ULTIMATE.start_node_create_~data#1| 1))) (or (and .cse0 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse1) (and .cse0 (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 1) .cse1))) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|) (let ((.cse14 (select |#memory_int| 1))) (let ((.cse2 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse3 (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse4 (= 2 (select |#length| 1))) (.cse5 (= (select |#valid| 1) 1)) (.cse6 (= (select |#valid| 0) 0)) (.cse7 (= (select |#valid| 2) 1)) (.cse8 (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|)) (.cse9 (= (select .cse14 0) 48)) (.cse10 (= 27 (select |#length| 2))) (.cse11 (= (select .cse14 1) 0)) (.cse12 (< 0 |#StackHeapBarrier|))) (or (and .cse2 .cse3 (= |ULTIMATE.start_sll_create_~len#1| |ULTIMATE.start_sll_create_#in~len#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (and .cse2 .cse3 (= |ULTIMATE.start_sll_create_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0)) .cse4 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse13) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) .cse11 (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |#StackHeapBarrier|) .cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse13) 0)))))) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-25 23:50:43,778 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2022-11-25 23:50:43,778 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-11-25 23:50:43,778 INFO L899 garLoopResultBuilder]: For program point L618(line 618) no Hoare annotation was computed. [2022-11-25 23:50:43,778 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-25 23:50:43,778 INFO L899 garLoopResultBuilder]: For program point L618-1(line 618) no Hoare annotation was computed. [2022-11-25 23:50:43,778 INFO L899 garLoopResultBuilder]: For program point L585-3(line 585) no Hoare annotation was computed. [2022-11-25 23:50:43,779 INFO L899 garLoopResultBuilder]: For program point L585-4(line 585) no Hoare annotation was computed. [2022-11-25 23:50:43,779 INFO L899 garLoopResultBuilder]: For program point L618-5(line 618) no Hoare annotation was computed. [2022-11-25 23:50:43,779 INFO L895 garLoopResultBuilder]: At program point L585-5(lines 585 589) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (let ((.cse0 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |#NULL.offset| 0)) (.cse3 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse0 .cse1 .cse2 .cse3) (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3))) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~len#1| 2)) [2022-11-25 23:50:43,779 INFO L899 garLoopResultBuilder]: For program point L618-6(line 618) no Hoare annotation was computed. [2022-11-25 23:50:43,779 INFO L895 garLoopResultBuilder]: At program point L618-7(lines 618 621) the Hoare annotation is: (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (let ((.cse0 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |#NULL.offset| 0))) (or (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse0 .cse1 .cse2))) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-25 23:50:43,780 INFO L899 garLoopResultBuilder]: For program point L618-8(lines 618 621) no Hoare annotation was computed. [2022-11-25 23:50:43,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2022-11-25 23:50:43,780 INFO L899 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2022-11-25 23:50:43,780 INFO L899 garLoopResultBuilder]: For program point L602-1(line 602) no Hoare annotation was computed. [2022-11-25 23:50:43,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2022-11-25 23:50:43,780 INFO L899 garLoopResultBuilder]: For program point L619(line 619) no Hoare annotation was computed. [2022-11-25 23:50:43,780 INFO L899 garLoopResultBuilder]: For program point L619-1(line 619) no Hoare annotation was computed. [2022-11-25 23:50:43,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:50:43,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2022-11-25 23:50:43,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2022-11-25 23:50:43,781 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-25 23:50:43,781 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-25 23:50:43,781 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-25 23:50:43,784 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:50:43,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:50:43,802 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:50:43,803 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,806 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:50:43,807 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,812 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,812 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:50:43,814 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:50:43,818 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,818 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:50:43,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,821 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:50:43,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:50:43 BoogieIcfgContainer [2022-11-25 23:50:43,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:50:43,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:50:43,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:50:43,828 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:50:43,829 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:49:29" (3/4) ... [2022-11-25 23:50:43,831 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:50:43,842 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-25 23:50:43,842 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-25 23:50:43,842 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 23:50:43,843 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:50:43,867 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 <= \old(data) && \old(data) <= 1) && head <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= len) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2 [2022-11-25 23:50:43,867 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((1 <= \old(data) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && ((((1 <= data && 0 <= head) && head <= 0) && data <= 1) || ((((1 <= data && 0 <= new_head) && new_head <= 0) && len <= 1) && data <= 1))) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && data == \old(data)) && ((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && len == \old(len)) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && data == unknown-#memory_int-unknown[new_head][0]) && 2 == unknown-#length-unknown[1]) && !(temp == new_head)) && head == new_head) && unknown-#length-unknown[new_head] == 8) && #memory_$Pointer$[new_head][4 + new_head] == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[1][1] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][4 + new_head] == 0))) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 [2022-11-25 23:50:43,867 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s == \result && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= len) && \result == head) && \result == s) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-25 23:50:43,868 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s == \result && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= len) && \result == head) && \result == s) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-25 23:50:43,868 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((0 <= index + 1 && s == \result) && \old(data) <= 3) && head == \result) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && \old(data) <= 1) && head <= 0) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && len <= 0) && 2 <= data) && 1 <= data) && data <= 3) && index <= 1) && head <= 0) && data <= 1) && 2 <= len + i) && \old(len) <= 2) && 0 <= len) && \result == head) && 2 <= \old(data)) && \result == s) && \old(index) <= 1) && 2 <= new_data) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 [2022-11-25 23:50:43,869 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((s == \result && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && len <= 0) && (((((((\old(index) == i && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && \old(index) == index + 1) && #memory_$Pointer$[head][head + 4] == head) && head == s) && 0 < \old(index)) || (((((head == head && \old(index) == i) && len + i == expected) && head == s) && \old(index) == index) && head == head))) && 1 <= data) && 0 <= head) && data <= 1) && 2 <= len + i) && \old(len) <= 2) && 0 <= len) && \result == head) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && \old(index) <= 1) && head <= 0) && 0 <= head [2022-11-25 23:50:43,869 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((s == \result && unknown-#memory_int-unknown[head][head] == \result) && head == \result) && \result == aux-sll_get_data_at(s, i)-aux) && 0 <= aux-sll_get_data_at(s, i)-aux + 2147483648) && ((((((((((((((\old(index) == i && 1 <= \old(data)) && \old(data) <= 1) && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && len <= 0) && \old(index) == index + 1) && 1 <= data) && #memory_$Pointer$[head][head + 4] == head) && data <= 1) && head == s) && head == s) && 0 < \old(index)) && s <= 0) || (((((((((((((head == head && \old(index) == i) && 1 <= \old(data)) && \old(data) <= 1) && len + i == expected) && len <= 0) && 1 <= data) && 0 <= i) && data <= 1) && head == s) && head == s) && \old(index) == index) && head == head) && s <= 0))) && aux-sll_get_data_at(s, i)-aux <= 2147483647) && \old(len) <= 2) && 0 <= len) && \result == head) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && \result == s) && !(0 < index)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head [2022-11-25 23:50:43,884 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:50:43,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:50:43,885 INFO L158 Benchmark]: Toolchain (without parser) took 75511.33ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 132.4MB in the beginning and 292.3MB in the end (delta: -159.9MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2022-11-25 23:50:43,885 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 111.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:50:43,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.06ms. Allocated memory is still 161.5MB. Free memory was 131.8MB in the beginning and 115.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:50:43,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.35ms. Allocated memory is still 161.5MB. Free memory was 115.2MB in the beginning and 112.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:50:43,885 INFO L158 Benchmark]: Boogie Preprocessor took 37.85ms. Allocated memory is still 161.5MB. Free memory was 112.9MB in the beginning and 110.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:50:43,886 INFO L158 Benchmark]: RCFGBuilder took 791.27ms. Allocated memory is still 161.5MB. Free memory was 110.9MB in the beginning and 90.6MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 23:50:43,886 INFO L158 Benchmark]: TraceAbstraction took 74019.45ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 90.0MB in the beginning and 296.5MB in the end (delta: -206.5MB). Peak memory consumption was 207.6MB. Max. memory is 16.1GB. [2022-11-25 23:50:43,886 INFO L158 Benchmark]: Witness Printer took 56.40ms. Allocated memory is still 408.9MB. Free memory was 295.5MB in the beginning and 292.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:50:43,887 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.28ms. Allocated memory is still 111.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.06ms. Allocated memory is still 161.5MB. Free memory was 131.8MB in the beginning and 115.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.35ms. Allocated memory is still 161.5MB. Free memory was 115.2MB in the beginning and 112.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.85ms. Allocated memory is still 161.5MB. Free memory was 112.9MB in the beginning and 110.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 791.27ms. Allocated memory is still 161.5MB. Free memory was 110.9MB in the beginning and 90.6MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 74019.45ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 90.0MB in the beginning and 296.5MB in the end (delta: -206.5MB). Peak memory consumption was 207.6MB. Max. memory is 16.1GB. * Witness Printer took 56.40ms. Allocated memory is still 408.9MB. Free memory was 295.5MB in the beginning and 292.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: 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, 48 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 73.9s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 976 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 976 mSDsluCounter, 1003 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 639 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1804 IncrementalHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 364 mSDtfsCounter, 1804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 835 GetRequests, 524 SyntacticMatches, 91 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 36.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=17, InterpolantAutomatonStates: 149, 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, 143 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 30 NumberOfFragments, 938 HoareAnnotationTreeSize, 10 FomulaSimplifications, 121 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 10 FomulaSimplificationsInter, 137621 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 827 ConstructedInterpolants, 0 QuantifiedInterpolants, 1487 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1995 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 235/266 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: 19.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 161, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 421, TOOLS_POST_TIME: 17.7s, 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: 421, TOOLS_QUANTIFIERELIM_TIME: 17.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.9s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 728, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 49, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 20, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 55, DOMAIN_ISSUBSETEQ_TIME: 0.2s, DOMAIN_ISBOTTOM_APPLICATIONS: 161, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 35, LOOP_SUMMARIZER_CACHE_MISSES: 35, LOOP_SUMMARIZER_OVERALL_TIME: 13.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 13.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 55, 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: 3390, DAG_COMPRESSION_RETAINED_NODES: 528, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((((((1 <= \old(data) && \old(data) <= 1) && head <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= len) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2 - InvariantResult [Line: 576]: Loop Invariant [2022-11-25 23:50:43,908 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:50:43,908 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,910 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:50:43,910 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((1 <= \old(data) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && ((((1 <= data && 0 <= head) && head <= 0) && data <= 1) || ((((1 <= data && 0 <= new_head) && new_head <= 0) && len <= 1) && data <= 1))) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && data == \old(data)) && ((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && len == \old(len)) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && data == unknown-#memory_int-unknown[new_head][0]) && 2 == unknown-#length-unknown[1]) && !(temp == new_head)) && head == new_head) && unknown-#length-unknown[new_head] == 8) && #memory_$Pointer$[new_head][4 + new_head] == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[1][1] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][4 + new_head] == 0))) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((s == \result && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= len) && \result == head) && \result == s) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 600]: Loop Invariant [2022-11-25 23:50:43,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:50:43,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((s == \result && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && len <= 0) && (((((((\old(index) == i && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && \old(index) == index + 1) && #memory_$Pointer$[head][head + 4] == head) && head == s) && 0 < \old(index)) || (((((head == head && \old(index) == i) && len + i == expected) && head == s) && \old(index) == index) && head == head))) && 1 <= data) && 0 <= head) && data <= 1) && 2 <= len + i) && \old(len) <= 2) && 0 <= len) && \result == head) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && \old(index) <= 1) && head <= 0) && 0 <= head - InvariantResult [Line: 624]: Loop Invariant [2022-11-25 23:50:43,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:50:43,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:50:43,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((s == \result && unknown-#memory_int-unknown[head][head] == \result) && head == \result) && \result == aux-sll_get_data_at(s, i)-aux) && 0 <= aux-sll_get_data_at(s, i)-aux + 2147483648) && ((((((((((((((\old(index) == i && 1 <= \old(data)) && \old(data) <= 1) && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && len <= 0) && \old(index) == index + 1) && 1 <= data) && #memory_$Pointer$[head][head + 4] == head) && data <= 1) && head == s) && head == s) && 0 < \old(index)) && s <= 0) || (((((((((((((head == head && \old(index) == i) && 1 <= \old(data)) && \old(data) <= 1) && len + i == expected) && len <= 0) && 1 <= data) && 0 <= i) && data <= 1) && head == s) && head == s) && \old(index) == index) && head == head) && s <= 0))) && aux-sll_get_data_at(s, i)-aux <= 2147483647) && \old(len) <= 2) && 0 <= len) && \result == head) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && \result == s) && !(0 < index)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((0 <= index + 1 && s == \result) && \old(data) <= 3) && head == \result) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && \old(data) <= 1) && head <= 0) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && len <= 0) && 2 <= data) && 1 <= data) && data <= 3) && index <= 1) && head <= 0) && data <= 1) && 2 <= len + i) && \old(len) <= 2) && 0 <= len) && \result == head) && 2 <= \old(data)) && \result == s) && \old(index) <= 1) && 2 <= new_data) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((((((((((((((s == \result && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= len) && \result == head) && \result == s) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 RESULT: Ultimate proved your program to be correct! [2022-11-25 23:50:43,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da94fac7-951d-43f0-bcaf-1f242f200806/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