./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh --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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 08:26:14,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:26:14,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:26:14,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:26:14,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:26:14,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:26:14,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:26:14,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:26:14,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:26:14,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:26:14,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:26:14,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:26:14,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:26:14,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:26:14,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:26:14,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:26:14,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:26:14,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:26:14,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:26:14,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:26:14,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:26:14,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:26:14,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:26:14,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:26:14,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:26:14,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:26:14,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:26:14,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:26:14,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:26:14,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:26:14,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:26:14,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:26:14,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:26:14,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:26:14,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:26:14,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:26:14,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:26:14,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:26:14,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:26:14,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:26:14,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:26:14,543 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 08:26:14,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:26:14,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:26:14,564 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:26:14,564 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:26:14,565 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:26:14,565 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:26:14,565 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:26:14,565 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:26:14,566 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:26:14,566 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 08:26:14,566 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:26:14,566 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:26:14,566 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 08:26:14,566 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 08:26:14,567 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:26:14,567 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 08:26:14,567 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 08:26:14,567 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 08:26:14,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:26:14,568 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:26:14,568 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 08:26:14,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:26:14,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:26:14,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:26:14,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 08:26:14,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:26:14,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 08:26:14,569 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 08:26:14,569 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:26:14,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 08:26:14,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:26:14,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 08:26:14,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:26:14,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:26:14,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:26:14,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:26:14,571 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 08:26:14,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:26:14,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 08:26:14,571 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 08:26:14,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 08:26:14,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 08:26:14,572 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:26:14,572 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_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/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_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2022-12-14 08:26:14,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:26:14,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:26:14,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:26:14,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:26:14,801 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:26:14,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-12-14 08:26:17,379 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:26:17,529 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:26:17,530 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-12-14 08:26:17,537 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/data/778012309/2fdecc47bb014e33a2368e0b7b24b0c0/FLAG02841c562 [2022-12-14 08:26:17,547 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/data/778012309/2fdecc47bb014e33a2368e0b7b24b0c0 [2022-12-14 08:26:17,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:26:17,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:26:17,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:26:17,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:26:17,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:26:17,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@acc708d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17, skipping insertion in model container [2022-12-14 08:26:17,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:26:17,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:26:17,773 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_c163ec89-dee7-4b40-9b92-d0b63d15964d/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2022-12-14 08:26:17,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:26:17,781 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 08:26:17,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_c163ec89-dee7-4b40-9b92-d0b63d15964d/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2022-12-14 08:26:17,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:26:17,826 INFO L208 MainTranslator]: Completed translation [2022-12-14 08:26:17,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17 WrapperNode [2022-12-14 08:26:17,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:26:17,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 08:26:17,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 08:26:17,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 08:26:17,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,857 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2022-12-14 08:26:17,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 08:26:17,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 08:26:17,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 08:26:17,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 08:26:17,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,876 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 08:26:17,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 08:26:17,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 08:26:17,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 08:26:17,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (1/1) ... [2022-12-14 08:26:17,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:26:17,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:17,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 08:26:17,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 08:26:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 08:26:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 08:26:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-14 08:26:17,934 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-14 08:26:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 08:26:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 08:26:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 08:26:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 08:26:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 08:26:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 08:26:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 08:26:17,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 08:26:18,034 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 08:26:18,036 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 08:26:18,253 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 08:26:18,297 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 08:26:18,297 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-14 08:26:18,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:26:18 BoogieIcfgContainer [2022-12-14 08:26:18,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 08:26:18,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 08:26:18,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 08:26:18,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 08:26:18,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 08:26:17" (1/3) ... [2022-12-14 08:26:18,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f87557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:26:18, skipping insertion in model container [2022-12-14 08:26:18,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:26:17" (2/3) ... [2022-12-14 08:26:18,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f87557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:26:18, skipping insertion in model container [2022-12-14 08:26:18,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:26:18" (3/3) ... [2022-12-14 08:26:18,305 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2022-12-14 08:26:18,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 08:26:18,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-12-14 08:26:18,353 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 08:26:18,358 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;@6d938c5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 08:26:18,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-12-14 08:26:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 44 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 08:26:18,367 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:18,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:18,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash 429436738, now seen corresponding path program 1 times [2022-12-14 08:26:18,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:18,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825043284] [2022-12-14 08:26:18,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:18,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:26:18,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:18,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825043284] [2022-12-14 08:26:18,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825043284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:18,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:18,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:26:18,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50949394] [2022-12-14 08:26:18,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:18,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:26:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:18,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:26:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:26:18,627 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 44 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 08:26:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:18,687 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-12-14 08:26:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:26:18,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-12-14 08:26:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:18,694 INFO L225 Difference]: With dead ends: 89 [2022-12-14 08:26:18,695 INFO L226 Difference]: Without dead ends: 49 [2022-12-14 08:26:18,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:26:18,699 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:18,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 86 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-14 08:26:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-12-14 08:26:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 39 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-12-14 08:26:18,728 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2022-12-14 08:26:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:18,729 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-12-14 08:26:18,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 08:26:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-12-14 08:26:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:26:18,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:18,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:18,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 08:26:18,730 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:18,731 INFO L85 PathProgramCache]: Analyzing trace with hash 380814026, now seen corresponding path program 1 times [2022-12-14 08:26:18,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:18,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383763898] [2022-12-14 08:26:18,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:18,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 08:26:18,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:18,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383763898] [2022-12-14 08:26:18,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383763898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:18,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:18,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:26:18,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371783725] [2022-12-14 08:26:18,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:18,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:26:18,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:18,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:26:18,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:26:18,866 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:18,924 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-12-14 08:26:18,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:26:18,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2022-12-14 08:26:18,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:18,926 INFO L225 Difference]: With dead ends: 49 [2022-12-14 08:26:18,926 INFO L226 Difference]: Without dead ends: 48 [2022-12-14 08:26:18,926 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-12-14 08:26:18,927 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:18,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-14 08:26:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-12-14 08:26:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:26:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-12-14 08:26:18,933 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 13 [2022-12-14 08:26:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:18,933 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-12-14 08:26:18,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-12-14 08:26:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 08:26:18,934 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:18,934 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:18,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 08:26:18,935 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1079667026, now seen corresponding path program 1 times [2022-12-14 08:26:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:18,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139944366] [2022-12-14 08:26:18,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:18,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 08:26:19,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:19,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139944366] [2022-12-14 08:26:19,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139944366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:19,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:19,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:26:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014570011] [2022-12-14 08:26:19,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:19,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:26:19,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:19,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:26:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:26:19,030 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:19,076 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-12-14 08:26:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:26:19,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-12-14 08:26:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:19,077 INFO L225 Difference]: With dead ends: 48 [2022-12-14 08:26:19,078 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 08:26:19,078 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-12-14 08:26:19,079 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:19,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 08:26:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-12-14 08:26:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:26:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-12-14 08:26:19,083 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 14 [2022-12-14 08:26:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:19,083 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-12-14 08:26:19,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-12-14 08:26:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 08:26:19,084 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:19,085 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:19,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 08:26:19,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:19,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:19,085 INFO L85 PathProgramCache]: Analyzing trace with hash 649914152, now seen corresponding path program 1 times [2022-12-14 08:26:19,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:19,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679108166] [2022-12-14 08:26:19,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:19,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:19,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:19,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679108166] [2022-12-14 08:26:19,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679108166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:19,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:19,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:26:19,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055721686] [2022-12-14 08:26:19,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:19,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:26:19,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:19,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:26:19,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:26:19,164 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:19,230 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-12-14 08:26:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:26:19,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-12-14 08:26:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:19,232 INFO L225 Difference]: With dead ends: 76 [2022-12-14 08:26:19,232 INFO L226 Difference]: Without dead ends: 74 [2022-12-14 08:26:19,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:26:19,234 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:19,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 85 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:26:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-14 08:26:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2022-12-14 08:26:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 46 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:26:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-12-14 08:26:19,241 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2022-12-14 08:26:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:19,241 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-12-14 08:26:19,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-12-14 08:26:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 08:26:19,242 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:19,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:19,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 08:26:19,242 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1327497694, now seen corresponding path program 1 times [2022-12-14 08:26:19,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:19,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463519295] [2022-12-14 08:26:19,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 08:26:19,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:19,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463519295] [2022-12-14 08:26:19,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463519295] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:19,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470072939] [2022-12-14 08:26:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:19,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:19,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:19,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:26:19,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 08:26:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:19,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 08:26:19,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:19,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:26:19,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470072939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:19,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:26:19,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 08:26:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765501489] [2022-12-14 08:26:19,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:19,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:26:19,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:19,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:26:19,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:26:19,497 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:19,550 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-12-14 08:26:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:26:19,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-12-14 08:26:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:19,551 INFO L225 Difference]: With dead ends: 74 [2022-12-14 08:26:19,551 INFO L226 Difference]: Without dead ends: 72 [2022-12-14 08:26:19,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:26:19,552 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:19,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 57 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-14 08:26:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-12-14 08:26:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.542857142857143) internal successors, (54), 48 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:26:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-12-14 08:26:19,559 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2022-12-14 08:26:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:19,559 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-12-14 08:26:19,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-12-14 08:26:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 08:26:19,560 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:19,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:19,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 08:26:19,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:19,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:19,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash -119994364, now seen corresponding path program 1 times [2022-12-14 08:26:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:19,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996263120] [2022-12-14 08:26:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:19,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:19,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996263120] [2022-12-14 08:26:19,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996263120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:19,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:19,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:26:19,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341355555] [2022-12-14 08:26:19,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:19,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:26:19,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:19,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:26:19,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:26:19,850 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:19,923 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2022-12-14 08:26:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:26:19,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-12-14 08:26:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:19,925 INFO L225 Difference]: With dead ends: 133 [2022-12-14 08:26:19,925 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 08:26:19,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:26:19,926 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 58 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:19,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:26:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 08:26:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 54. [2022-12-14 08:26:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 49 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:26:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-12-14 08:26:19,933 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 20 [2022-12-14 08:26:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:19,934 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-12-14 08:26:19,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-12-14 08:26:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 08:26:19,935 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:19,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:19,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 08:26:19,935 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash -119990694, now seen corresponding path program 1 times [2022-12-14 08:26:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:19,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383115039] [2022-12-14 08:26:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:20,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:20,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383115039] [2022-12-14 08:26:20,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383115039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:20,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:20,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:26:20,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080281843] [2022-12-14 08:26:20,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:20,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:26:20,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:20,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:26:20,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:26:20,024 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:20,079 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-12-14 08:26:20,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:26:20,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-12-14 08:26:20,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:20,079 INFO L225 Difference]: With dead ends: 68 [2022-12-14 08:26:20,080 INFO L226 Difference]: Without dead ends: 66 [2022-12-14 08:26:20,080 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-12-14 08:26:20,080 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:20,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 87 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:20,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-14 08:26:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-12-14 08:26:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.5) internal successors, (57), 51 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:26:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-12-14 08:26:20,085 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 20 [2022-12-14 08:26:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:20,085 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-12-14 08:26:20,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-12-14 08:26:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 08:26:20,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:20,085 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:20,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 08:26:20,086 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:20,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash 93099952, now seen corresponding path program 1 times [2022-12-14 08:26:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:20,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197602049] [2022-12-14 08:26:20,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 08:26:20,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:20,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197602049] [2022-12-14 08:26:20,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197602049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:20,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:20,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:26:20,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027658107] [2022-12-14 08:26:20,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:20,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:26:20,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:20,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:26:20,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:26:20,133 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 08:26:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:20,170 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-12-14 08:26:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:26:20,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-12-14 08:26:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:20,171 INFO L225 Difference]: With dead ends: 56 [2022-12-14 08:26:20,171 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 08:26:20,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:26:20,172 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:20,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 08:26:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-14 08:26:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:26:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-12-14 08:26:20,176 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2022-12-14 08:26:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:20,176 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-12-14 08:26:20,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 08:26:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-12-14 08:26:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 08:26:20,177 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:20,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:20,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 08:26:20,177 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:20,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash 268208809, now seen corresponding path program 1 times [2022-12-14 08:26:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:20,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281231808] [2022-12-14 08:26:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:20,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:20,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281231808] [2022-12-14 08:26:20,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281231808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:20,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:20,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:26:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956798164] [2022-12-14 08:26:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:20,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:26:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:20,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:26:20,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:26:20,227 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:20,284 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-12-14 08:26:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:26:20,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-12-14 08:26:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:20,286 INFO L225 Difference]: With dead ends: 81 [2022-12-14 08:26:20,286 INFO L226 Difference]: Without dead ends: 66 [2022-12-14 08:26:20,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:26:20,287 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:20,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-14 08:26:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-12-14 08:26:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 51 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 08:26:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-12-14 08:26:20,291 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 21 [2022-12-14 08:26:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:20,292 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-12-14 08:26:20,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-12-14 08:26:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 08:26:20,292 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:20,292 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:20,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 08:26:20,292 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1408868728, now seen corresponding path program 1 times [2022-12-14 08:26:20,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:20,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481143991] [2022-12-14 08:26:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 08:26:20,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:20,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481143991] [2022-12-14 08:26:20,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481143991] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:20,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956198453] [2022-12-14 08:26:20,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:20,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:20,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:20,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:26:20,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 08:26:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:20,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 08:26:20,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 08:26:20,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:26:20,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956198453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:20,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:26:20,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-14 08:26:20,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205051192] [2022-12-14 08:26:20,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:20,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:26:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:20,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:26:20,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:26:20,542 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 08:26:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:20,580 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-12-14 08:26:20,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:26:20,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-12-14 08:26:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:20,581 INFO L225 Difference]: With dead ends: 99 [2022-12-14 08:26:20,581 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 08:26:20,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:26:20,582 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 68 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:20,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 08:26:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-12-14 08:26:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-12-14 08:26:20,589 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 22 [2022-12-14 08:26:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:20,589 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-12-14 08:26:20,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 08:26:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-12-14 08:26:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 08:26:20,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:20,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:20,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 08:26:20,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:20,791 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:20,791 INFO L85 PathProgramCache]: Analyzing trace with hash -275372865, now seen corresponding path program 1 times [2022-12-14 08:26:20,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:20,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137645506] [2022-12-14 08:26:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:20,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:20,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137645506] [2022-12-14 08:26:20,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137645506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:20,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:20,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:26:20,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466763747] [2022-12-14 08:26:20,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:20,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:26:20,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:20,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:26:20,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:26:20,851 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:20,900 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-12-14 08:26:20,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:26:20,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-12-14 08:26:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:20,901 INFO L225 Difference]: With dead ends: 56 [2022-12-14 08:26:20,901 INFO L226 Difference]: Without dead ends: 54 [2022-12-14 08:26:20,901 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-12-14 08:26:20,901 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:20,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-14 08:26:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-12-14 08:26:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-12-14 08:26:20,905 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 22 [2022-12-14 08:26:20,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:20,905 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-12-14 08:26:20,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-12-14 08:26:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 08:26:20,906 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:20,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:20,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 08:26:20,906 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:20,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:20,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1229877301, now seen corresponding path program 1 times [2022-12-14 08:26:20,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:20,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380830265] [2022-12-14 08:26:20,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:20,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:20,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:20,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380830265] [2022-12-14 08:26:20,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380830265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:20,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122553112] [2022-12-14 08:26:20,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:20,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:20,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:20,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:26:20,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 08:26:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:21,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 08:26:21,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:21,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:26:21,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122553112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:21,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:26:21,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-14 08:26:21,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123226215] [2022-12-14 08:26:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:21,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:26:21,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:21,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:26:21,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-14 08:26:21,171 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:21,250 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-12-14 08:26:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:26:21,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-12-14 08:26:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:21,251 INFO L225 Difference]: With dead ends: 54 [2022-12-14 08:26:21,251 INFO L226 Difference]: Without dead ends: 52 [2022-12-14 08:26:21,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-14 08:26:21,252 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:21,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 60 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:26:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-14 08:26:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-12-14 08:26:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.358974358974359) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-12-14 08:26:21,258 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2022-12-14 08:26:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:21,258 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-12-14 08:26:21,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-12-14 08:26:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:26:21,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:21,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:21,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 08:26:21,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 08:26:21,461 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash 528509407, now seen corresponding path program 1 times [2022-12-14 08:26:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:21,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840312064] [2022-12-14 08:26:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:21,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 08:26:21,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:21,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840312064] [2022-12-14 08:26:21,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840312064] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:21,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583534928] [2022-12-14 08:26:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:21,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:21,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:21,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:26:21,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 08:26:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:21,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 08:26:21,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:21,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:26:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:21,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583534928] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:26:21,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1817632971] [2022-12-14 08:26:21,920 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-12-14 08:26:21,920 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:26:21,924 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:26:21,929 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:26:21,930 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:26:22,005 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-12-14 08:26:22,010 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-12-14 08:26:22,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,023 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 27 treesize of output 17 [2022-12-14 08:26:22,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,044 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 21 treesize of output 26 [2022-12-14 08:26:22,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,053 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 27 treesize of output 17 [2022-12-14 08:26:22,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:26:22,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:26:22,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:22,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:22,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-12-14 08:26:22,359 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:22,361 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:22,362 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:22,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:22,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:22,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:22,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:22,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:22,574 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:22,575 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:22,577 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:22,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-12-14 08:26:22,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:22,643 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 08:26:22,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2022-12-14 08:26:22,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:22,663 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 08:26:22,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2022-12-14 08:26:22,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:26:22,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 7 [2022-12-14 08:26:22,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:22,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:26:22,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:22,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:22,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-12-14 08:26:22,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:22,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:22,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:22,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-12-14 08:26:22,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:23,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:23,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 127 [2022-12-14 08:26:23,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:23,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 127 [2022-12-14 08:26:23,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:23,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2022-12-14 08:26:23,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:23,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2022-12-14 08:26:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:23,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 121 [2022-12-14 08:26:23,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:23,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 121 [2022-12-14 08:26:23,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:23,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:26:23,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-12-14 08:26:23,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:23,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:26:23,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:23,563 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:23,565 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:23,566 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:23,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:23,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:23,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:23,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:23,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:23,743 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:23,745 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:23,746 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:23,748 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:23,770 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 08:26:23,885 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:26:27,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1817632971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:27,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:26:27,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 5, 5] total 25 [2022-12-14 08:26:27,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794167759] [2022-12-14 08:26:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:27,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 08:26:27,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:27,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 08:26:27,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2022-12-14 08:26:27,385 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 14 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:28,616 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-12-14 08:26:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 08:26:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-12-14 08:26:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:28,616 INFO L225 Difference]: With dead ends: 82 [2022-12-14 08:26:28,617 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 08:26:28,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-12-14 08:26:28,617 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:28,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 155 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 08:26:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 08:26:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-12-14 08:26:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-12-14 08:26:28,629 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 24 [2022-12-14 08:26:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:28,629 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-12-14 08:26:28,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-12-14 08:26:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 08:26:28,630 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:28,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:28,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 08:26:28,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 08:26:28,831 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:28,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1091401857, now seen corresponding path program 1 times [2022-12-14 08:26:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:28,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414172726] [2022-12-14 08:26:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 08:26:28,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:28,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414172726] [2022-12-14 08:26:28,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414172726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:28,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:28,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:26:28,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183910820] [2022-12-14 08:26:28,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:28,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:26:28,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:28,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:26:28,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:26:28,922 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:28,959 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-12-14 08:26:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:26:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-12-14 08:26:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:28,960 INFO L225 Difference]: With dead ends: 56 [2022-12-14 08:26:28,960 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 08:26:28,961 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-12-14 08:26:28,961 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:28,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 08:26:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-14 08:26:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.302325581395349) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-12-14 08:26:28,968 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 26 [2022-12-14 08:26:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:28,969 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-12-14 08:26:28,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-12-14 08:26:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 08:26:28,969 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:28,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:28,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 08:26:28,970 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash -526280714, now seen corresponding path program 1 times [2022-12-14 08:26:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:28,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175346334] [2022-12-14 08:26:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:28,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:29,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:29,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175346334] [2022-12-14 08:26:29,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175346334] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:29,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167794650] [2022-12-14 08:26:29,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:29,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:29,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:29,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:26:29,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 08:26:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:29,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 08:26:29,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:29,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:26:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:29,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167794650] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:26:29,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1338591938] [2022-12-14 08:26:29,250 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-12-14 08:26:29,250 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:26:29,250 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:26:29,250 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:26:29,250 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:26:29,269 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-12-14 08:26:29,273 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-12-14 08:26:29,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,282 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 27 treesize of output 17 [2022-12-14 08:26:29,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,289 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 27 treesize of output 17 [2022-12-14 08:26:29,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,303 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 21 treesize of output 26 [2022-12-14 08:26:29,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:29,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:26:29,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-12-14 08:26:29,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:26:29,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:29,534 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:29,535 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:29,536 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:29,538 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:29,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:29,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:29,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:29,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:29,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:29,722 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:29,723 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:29,725 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:29,726 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:29,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-12-14 08:26:29,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,777 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 08:26:29,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-12-14 08:26:29,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,799 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 08:26:29,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-12-14 08:26:29,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:29,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:26:29,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 7 [2022-12-14 08:26:29,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:26:29,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:29,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:29,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:29,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-12-14 08:26:29,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:29,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:29,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:29,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-12-14 08:26:30,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:30,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 144 [2022-12-14 08:26:30,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:30,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 131 [2022-12-14 08:26:30,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:30,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 131 [2022-12-14 08:26:30,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:30,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 144 [2022-12-14 08:26:30,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:30,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 131 [2022-12-14 08:26:30,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:30,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:26:30,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 131 [2022-12-14 08:26:30,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:30,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:30,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:30,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:30,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:30,625 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:30,626 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:30,627 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:30,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:30,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:30,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:30,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:30,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:30,804 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:30,805 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:30,806 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:30,807 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:30,828 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 08:26:30,943 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:26:35,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1338591938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:35,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:26:35,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6, 6, 6] total 26 [2022-12-14 08:26:35,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132354626] [2022-12-14 08:26:35,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:35,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 08:26:35,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:35,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 08:26:35,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-12-14 08:26:35,117 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:36,413 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-12-14 08:26:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 08:26:36,414 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-12-14 08:26:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:36,414 INFO L225 Difference]: With dead ends: 58 [2022-12-14 08:26:36,414 INFO L226 Difference]: Without dead ends: 57 [2022-12-14 08:26:36,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2022-12-14 08:26:36,415 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:36,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 130 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 08:26:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-14 08:26:36,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-12-14 08:26:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.288888888888889) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-12-14 08:26:36,422 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 27 [2022-12-14 08:26:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:36,422 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-12-14 08:26:36,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-12-14 08:26:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 08:26:36,423 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:36,423 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:36,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 08:26:36,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:36,625 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1798037889, now seen corresponding path program 1 times [2022-12-14 08:26:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:36,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187839609] [2022-12-14 08:26:36,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:36,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:36,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:36,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187839609] [2022-12-14 08:26:36,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187839609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:36,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473802121] [2022-12-14 08:26:36,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:36,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:36,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:36,718 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:26:36,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 08:26:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:36,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 08:26:36,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:36,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:26:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:26:36,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473802121] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:26:36,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929598534] [2022-12-14 08:26:36,898 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-12-14 08:26:36,898 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:26:36,898 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:26:36,898 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:26:36,898 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:26:36,910 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-12-14 08:26:36,914 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-12-14 08:26:36,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:36,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:36,922 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 27 treesize of output 17 [2022-12-14 08:26:36,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:36,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:36,933 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 21 treesize of output 26 [2022-12-14 08:26:36,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:36,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:36,939 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 27 treesize of output 17 [2022-12-14 08:26:37,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:37,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:37,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:37,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:37,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:37,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:37,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:37,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:37,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:37,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:37,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:37,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-12-14 08:26:37,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:37,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:37,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:37,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:37,174 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 08:26:37,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 330 [2022-12-14 08:26:37,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:37,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:37,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:37,205 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 08:26:37,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 324 treesize of output 229 [2022-12-14 08:26:37,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,227 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 37 treesize of output 13 [2022-12-14 08:26:37,241 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 08:26:37,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 55 [2022-12-14 08:26:37,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-12-14 08:26:37,263 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 08:26:37,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 30 [2022-12-14 08:26:37,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 08:26:37,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:26:37,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 7 [2022-12-14 08:26:37,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:37,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:37,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:26:37,451 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 19 treesize of output 1 [2022-12-14 08:26:37,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 08:26:37,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 13 treesize of output 9 [2022-12-14 08:26:37,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:37,602 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 19 treesize of output 1 [2022-12-14 08:26:37,608 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 19 treesize of output 1 [2022-12-14 08:26:37,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:37,736 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 19 treesize of output 1 [2022-12-14 08:26:37,751 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 19 treesize of output 1 [2022-12-14 08:26:37,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:37,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:37,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:37,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:37,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:37,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:37,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:37,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:37,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:37,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:37,903 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 08:26:37,996 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:26:40,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [929598534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:40,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:26:40,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [8, 8, 8] total 24 [2022-12-14 08:26:40,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389340801] [2022-12-14 08:26:40,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:40,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 08:26:40,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:40,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 08:26:40,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-12-14 08:26:40,938 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:42,374 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-12-14 08:26:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 08:26:42,374 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-12-14 08:26:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:42,375 INFO L225 Difference]: With dead ends: 57 [2022-12-14 08:26:42,375 INFO L226 Difference]: Without dead ends: 54 [2022-12-14 08:26:42,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 61 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2022-12-14 08:26:42,376 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:42,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 102 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 08:26:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-14 08:26:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-12-14 08:26:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-12-14 08:26:42,383 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 30 [2022-12-14 08:26:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:42,384 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-12-14 08:26:42,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-12-14 08:26:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 08:26:42,384 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:42,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:42,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-14 08:26:42,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 08:26:42,586 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:42,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1758048611, now seen corresponding path program 1 times [2022-12-14 08:26:42,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:42,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490500935] [2022-12-14 08:26:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:42,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 08:26:42,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:42,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490500935] [2022-12-14 08:26:42,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490500935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:42,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338102645] [2022-12-14 08:26:42,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:42,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:42,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:42,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:26:42,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 08:26:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:42,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 08:26:42,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 08:26:42,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:26:42,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338102645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:42,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:26:42,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-12-14 08:26:42,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409675465] [2022-12-14 08:26:42,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:42,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:26:42,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:26:42,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-14 08:26:42,906 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:42,984 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-12-14 08:26:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:26:42,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-12-14 08:26:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:42,985 INFO L225 Difference]: With dead ends: 54 [2022-12-14 08:26:42,985 INFO L226 Difference]: Without dead ends: 52 [2022-12-14 08:26:42,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-14 08:26:42,986 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:42,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 58 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:26:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-14 08:26:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-12-14 08:26:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-12-14 08:26:42,995 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2022-12-14 08:26:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:42,995 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-12-14 08:26:42,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-12-14 08:26:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 08:26:43,000 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:43,000 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:26:43,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 08:26:43,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 08:26:43,201 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1335067792, now seen corresponding path program 1 times [2022-12-14 08:26:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:43,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736685216] [2022-12-14 08:26:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 08:26:43,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:43,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736685216] [2022-12-14 08:26:43,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736685216] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:43,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537634176] [2022-12-14 08:26:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:43,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:43,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:43,340 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:26:43,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 08:26:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:43,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 08:26:43,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 08:26:43,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:26:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 08:26:43,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537634176] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:26:43,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601497127] [2022-12-14 08:26:43,587 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 08:26:43,587 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:26:43,587 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:26:43,587 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:26:43,588 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:26:43,606 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-12-14 08:26:43,609 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-12-14 08:26:43,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:43,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:43,617 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 27 treesize of output 17 [2022-12-14 08:26:43,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:43,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:43,629 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 21 treesize of output 26 [2022-12-14 08:26:43,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:43,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:43,635 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 27 treesize of output 17 [2022-12-14 08:26:43,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:43,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:43,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:43,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:43,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:43,837 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:43,839 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:43,840 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:43,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:43,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:43,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:43,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:43,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:43,969 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:43,970 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:43,971 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:43,972 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:44,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:44,010 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 08:26:44,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-12-14 08:26:44,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:44,029 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 08:26:44,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-12-14 08:26:44,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:44,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:44,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-12-14 08:26:44,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:44,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 7 [2022-12-14 08:26:44,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:44,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:26:44,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:44,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:44,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:26:44,216 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 19 treesize of output 1 [2022-12-14 08:26:44,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:44,232 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 19 treesize of output 1 [2022-12-14 08:26:44,330 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 19 treesize of output 1 [2022-12-14 08:26:44,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:44,342 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 19 treesize of output 1 [2022-12-14 08:26:44,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:44,449 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 19 treesize of output 1 [2022-12-14 08:26:44,454 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 19 treesize of output 1 [2022-12-14 08:26:44,774 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 19 treesize of output 1 [2022-12-14 08:26:44,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 08:26:44,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:44,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:44,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:44,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:26:44,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:44,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:26:44,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:44,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-12-14 08:26:44,964 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:44,965 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:44,966 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:45,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:45,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:45,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:45,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:45,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:45,080 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:45,081 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:45,082 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:45,097 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 08:26:45,202 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:26:49,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [601497127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:49,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:26:49,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [8, 5, 5] total 33 [2022-12-14 08:26:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525616008] [2022-12-14 08:26:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:49,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 08:26:49,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 08:26:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 08:26:49,731 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 20 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:52,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:52,511 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-12-14 08:26:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 08:26:52,511 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-12-14 08:26:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:52,512 INFO L225 Difference]: With dead ends: 68 [2022-12-14 08:26:52,512 INFO L226 Difference]: Without dead ends: 66 [2022-12-14 08:26:52,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 85 SyntacticMatches, 12 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=354, Invalid=1538, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 08:26:52,512 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 64 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:52,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 78 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 08:26:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-14 08:26:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-12-14 08:26:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-12-14 08:26:52,522 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 41 [2022-12-14 08:26:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:52,522 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-12-14 08:26:52,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-12-14 08:26:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 08:26:52,523 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:52,523 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, 1] [2022-12-14 08:26:52,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 08:26:52,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 08:26:52,724 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:52,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:52,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1195077362, now seen corresponding path program 1 times [2022-12-14 08:26:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:52,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407601299] [2022-12-14 08:26:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 08:26:52,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:52,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407601299] [2022-12-14 08:26:52,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407601299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:26:52,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:26:52,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:26:52,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915559950] [2022-12-14 08:26:52,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:26:52,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:26:52,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:26:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:26:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:26:52,826 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:26:52,866 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-12-14 08:26:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:26:52,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-12-14 08:26:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:26:52,867 INFO L225 Difference]: With dead ends: 54 [2022-12-14 08:26:52,867 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 08:26:52,867 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-12-14 08:26:52,868 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:26:52,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:26:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 08:26:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-12-14 08:26:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:26:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-12-14 08:26:52,879 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 43 [2022-12-14 08:26:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:26:52,879 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-12-14 08:26:52,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:26:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-12-14 08:26:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 08:26:52,880 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:26:52,880 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, 1, 1] [2022-12-14 08:26:52,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 08:26:52,880 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:26:52,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:26:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1607307314, now seen corresponding path program 1 times [2022-12-14 08:26:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:26:52,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718325028] [2022-12-14 08:26:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:26:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 08:26:52,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:26:52,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718325028] [2022-12-14 08:26:52,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718325028] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:26:52,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009220671] [2022-12-14 08:26:52,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:26:52,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:26:52,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:26:52,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:26:52,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 08:26:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:26:53,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 08:26:53,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:26:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 08:26:53,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:26:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 08:26:53,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009220671] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:26:53,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1492606498] [2022-12-14 08:26:53,197 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 08:26:53,198 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:26:53,198 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:26:53,198 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:26:53,198 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:26:53,218 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-12-14 08:26:53,221 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-12-14 08:26:53,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,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 27 treesize of output 17 [2022-12-14 08:26:53,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,235 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 27 treesize of output 17 [2022-12-14 08:26:53,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,247 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 21 treesize of output 26 [2022-12-14 08:26:53,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:53,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:53,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:53,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:53,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:53,449 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:53,450 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:53,451 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:53,452 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:53,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:53,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:53,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:53,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:53,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:53,633 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:53,634 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:53,635 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:53,636 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:53,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:53,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-12-14 08:26:53,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:53,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:53,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:53,731 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 08:26:53,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 334 [2022-12-14 08:26:53,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:53,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:53,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:53,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:53,763 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 08:26:53,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 340 treesize of output 246 [2022-12-14 08:26:53,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,789 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 49 treesize of output 13 [2022-12-14 08:26:53,807 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-14 08:26:53,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 118 [2022-12-14 08:26:53,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 78 [2022-12-14 08:26:53,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:53,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:26:53,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:26:53,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:53,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 7 [2022-12-14 08:26:54,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:54,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:54,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:54,128 INFO L321 Elim1Store]: treesize reduction 112, result has 17.6 percent of original size [2022-12-14 08:26:54,129 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 6 case distinctions, treesize of input 323 treesize of output 303 [2022-12-14 08:26:54,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:54,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:54,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:26:54,179 INFO L321 Elim1Store]: treesize reduction 112, result has 17.6 percent of original size [2022-12-14 08:26:54,180 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 6 case distinctions, treesize of input 323 treesize of output 303 [2022-12-14 08:26:54,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:54,416 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 19 treesize of output 1 [2022-12-14 08:26:54,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:54,431 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 19 treesize of output 1 [2022-12-14 08:26:54,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 08:26:54,787 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 19 treesize of output 1 [2022-12-14 08:26:54,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:26:55,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:55,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:26:55,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:55,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:26:55,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:26:55,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-12-14 08:26:55,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:55,071 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:55,072 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:55,073 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:55,074 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:55,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:55,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:26:55,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:55,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:26:55,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:26:55,212 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:55,213 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:55,214 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:55,215 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 08:26:55,231 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 08:26:55,320 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:27:00,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1492606498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:27:00,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:27:00,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 33 [2022-12-14 08:27:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145056542] [2022-12-14 08:27:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:27:00,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 08:27:00,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:27:00,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 08:27:00,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=963, Unknown=2, NotChecked=0, Total=1122 [2022-12-14 08:27:00,921 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:27:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:27:04,237 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-12-14 08:27:04,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 08:27:04,238 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-12-14 08:27:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:27:04,238 INFO L225 Difference]: With dead ends: 64 [2022-12-14 08:27:04,238 INFO L226 Difference]: Without dead ends: 63 [2022-12-14 08:27:04,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 92 SyntacticMatches, 12 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=280, Invalid=1698, Unknown=2, NotChecked=0, Total=1980 [2022-12-14 08:27:04,239 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 08:27:04,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 47 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 08:27:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-14 08:27:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-12-14 08:27:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.163265306122449) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:27:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-12-14 08:27:04,249 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 44 [2022-12-14 08:27:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:27:04,249 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-12-14 08:27:04,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:27:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-12-14 08:27:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 08:27:04,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:27:04,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:27:04,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 08:27:04,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:27:04,451 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:27:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:27:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1298314928, now seen corresponding path program 1 times [2022-12-14 08:27:04,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:27:04,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018346272] [2022-12-14 08:27:04,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:27:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:27:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:27:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 08:27:04,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:27:04,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018346272] [2022-12-14 08:27:04,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018346272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:27:04,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312102676] [2022-12-14 08:27:04,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:27:04,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:27:04,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:27:04,591 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:27:04,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 08:27:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:27:04,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 08:27:04,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:27:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 08:27:04,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:27:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 08:27:04,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312102676] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:27:04,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [639796476] [2022-12-14 08:27:04,815 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 08:27:04,815 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:27:04,816 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:27:04,816 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:27:04,816 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:27:04,835 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-12-14 08:27:04,838 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-12-14 08:27:04,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:04,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:04,844 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 27 treesize of output 17 [2022-12-14 08:27:04,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:04,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:04,850 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 27 treesize of output 17 [2022-12-14 08:27:04,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:04,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:04,858 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 21 treesize of output 26 [2022-12-14 08:27:04,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:04,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:04,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:27:04,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-12-14 08:27:04,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:04,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:04,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:27:04,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:04,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:04,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:04,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:27:04,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-12-14 08:27:04,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:04,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:27:05,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:05,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:05,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-12-14 08:27:05,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:05,037 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 08:27:05,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-12-14 08:27:05,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:05,053 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 08:27:05,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-12-14 08:27:05,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:05,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:27:05,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:05,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 7 [2022-12-14 08:27:05,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:27:05,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:05,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:27:05,230 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 19 treesize of output 1 [2022-12-14 08:27:05,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:05,248 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 19 treesize of output 1 [2022-12-14 08:27:05,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:05,347 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 19 treesize of output 1 [2022-12-14 08:27:05,355 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 19 treesize of output 1 [2022-12-14 08:27:05,450 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 19 treesize of output 1 [2022-12-14 08:27:05,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 13 treesize of output 9 [2022-12-14 08:27:05,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 19 treesize of output 1 [2022-12-14 08:27:06,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:06,145 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 19 treesize of output 1 [2022-12-14 08:27:06,152 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 19 treesize of output 1 [2022-12-14 08:27:06,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:06,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:27:06,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:06,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:06,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:27:06,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:06,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-12-14 08:27:06,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:06,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:27:06,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:06,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:06,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 08:27:06,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:06,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-12-14 08:27:06,298 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 84 for LOIs [2022-12-14 08:27:06,388 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:27:10,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [639796476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:27:10,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:27:10,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [8, 8, 8] total 30 [2022-12-14 08:27:10,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757061100] [2022-12-14 08:27:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:27:10,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 08:27:10,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:27:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 08:27:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2022-12-14 08:27:10,590 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:27:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:27:13,637 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-12-14 08:27:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 08:27:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-12-14 08:27:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:27:13,638 INFO L225 Difference]: With dead ends: 60 [2022-12-14 08:27:13,638 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 08:27:13,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 102 SyntacticMatches, 17 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=248, Invalid=1732, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 08:27:13,639 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 08:27:13,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 08:27:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 08:27:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-12-14 08:27:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:27:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-12-14 08:27:13,650 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 47 [2022-12-14 08:27:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:27:13,650 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-12-14 08:27:13,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:27:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-12-14 08:27:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 08:27:13,651 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:27:13,651 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:27:13,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 08:27:13,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:27:13,853 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:27:13,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:27:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1595801369, now seen corresponding path program 1 times [2022-12-14 08:27:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:27:13,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411180116] [2022-12-14 08:27:13,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:27:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:27:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:27:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 08:27:13,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:27:13,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411180116] [2022-12-14 08:27:13,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411180116] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:27:13,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135955415] [2022-12-14 08:27:13,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:27:13,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:27:13,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:27:13,986 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:27:13,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 08:27:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:27:14,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 08:27:14,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:27:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 08:27:14,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:27:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 08:27:14,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135955415] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:27:14,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1770108326] [2022-12-14 08:27:14,217 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 08:27:14,217 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:27:14,217 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:27:14,218 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:27:14,218 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:27:14,235 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-12-14 08:27:14,237 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-12-14 08:27:14,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,249 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 21 treesize of output 26 [2022-12-14 08:27:14,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,254 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 27 treesize of output 17 [2022-12-14 08:27:14,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,264 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 27 treesize of output 17 [2022-12-14 08:27:14,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:27:14,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:14,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:14,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:14,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:14,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:27:14,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:14,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:14,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:14,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:14,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-12-14 08:27:14,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,444 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 08:27:14,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-12-14 08:27:14,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,459 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 08:27:14,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-12-14 08:27:14,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:27:14,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:27:14,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 7 [2022-12-14 08:27:14,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:14,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:27:14,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:14,627 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 19 treesize of output 1 [2022-12-14 08:27:14,633 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 19 treesize of output 1 [2022-12-14 08:27:14,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:14,731 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 19 treesize of output 1 [2022-12-14 08:27:14,737 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 19 treesize of output 1 [2022-12-14 08:27:14,827 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 19 treesize of output 1 [2022-12-14 08:27:14,834 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 19 treesize of output 1 [2022-12-14 08:27:14,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:15,487 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 19 treesize of output 1 [2022-12-14 08:27:15,498 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 19 treesize of output 1 [2022-12-14 08:27:15,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:15,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:15,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:27:15,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:15,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:15,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:15,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:15,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:15,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:15,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:27:15,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:15,653 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 08:27:15,761 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:27:20,112 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5497#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (< 2147483646 |ULTIMATE.start_main_#t~post16#1|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-12-14 08:27:20,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 08:27:20,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:27:20,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-14 08:27:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369391394] [2022-12-14 08:27:20,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:27:20,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 08:27:20,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:27:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 08:27:20,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 08:27:20,114 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:27:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:27:20,245 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2022-12-14 08:27:20,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 08:27:20,245 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-12-14 08:27:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:27:20,246 INFO L225 Difference]: With dead ends: 102 [2022-12-14 08:27:20,246 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 08:27:20,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 107 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 08:27:20,247 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 93 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:27:20,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 93 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:27:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 08:27:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2022-12-14 08:27:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.1304347826086956) internal successors, (104), 92 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 08:27:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2022-12-14 08:27:20,268 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 48 [2022-12-14 08:27:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:27:20,268 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2022-12-14 08:27:20,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 08:27:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-12-14 08:27:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-14 08:27:20,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:27:20,269 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 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] [2022-12-14 08:27:20,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 08:27:20,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 08:27:20,471 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 08:27:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:27:20,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1592020435, now seen corresponding path program 2 times [2022-12-14 08:27:20,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:27:20,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036327833] [2022-12-14 08:27:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:27:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:27:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:27:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 08:27:20,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:27:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036327833] [2022-12-14 08:27:20,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036327833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:27:20,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587534694] [2022-12-14 08:27:20,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 08:27:20,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:27:20,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:27:20,604 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:27:20,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 08:27:20,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 08:27:20,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:27:20,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 08:27:20,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:27:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-14 08:27:20,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:27:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-14 08:27:20,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587534694] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:27:20,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [180426809] [2022-12-14 08:27:20,875 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 08:27:20,876 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:27:20,876 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:27:20,876 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:27:20,876 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:27:20,894 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-12-14 08:27:20,896 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-12-14 08:27:20,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:20,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:20,908 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 21 treesize of output 26 [2022-12-14 08:27:20,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:20,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:20,913 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 27 treesize of output 17 [2022-12-14 08:27:20,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:20,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:20,918 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 27 treesize of output 17 [2022-12-14 08:27:20,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:20,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:20,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:27:21,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:21,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:21,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:21,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:21,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:21,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:27:21,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:21,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:21,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:21,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:27:21,085 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 08:27:21,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2022-12-14 08:27:21,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:21,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:21,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:27:21,106 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 08:27:21,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2022-12-14 08:27:21,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:21,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:21,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:21,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-12-14 08:27:21,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:27:21,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:21,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:27:21,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:21,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 17 [2022-12-14 08:27:21,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:27:21,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 7 [2022-12-14 08:27:21,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:21,270 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 19 treesize of output 1 [2022-12-14 08:27:21,277 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 19 treesize of output 1 [2022-12-14 08:27:21,363 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 19 treesize of output 1 [2022-12-14 08:27:21,368 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 19 treesize of output 1 [2022-12-14 08:27:21,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:21,460 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 19 treesize of output 1 [2022-12-14 08:27:21,466 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 19 treesize of output 1 [2022-12-14 08:27:21,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:22,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:27:22,106 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 19 treesize of output 1 [2022-12-14 08:27:22,110 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 19 treesize of output 1 [2022-12-14 08:27:22,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:27:22,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:22,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:22,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:22,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:22,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:22,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-12-14 08:27:22,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:22,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 08:27:22,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-14 08:27:22,230 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 08:27:22,312 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:27:26,628 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6217#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (< 2147483646 |ULTIMATE.start_main_#t~post16#1|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |#NULL.base| 0))) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-12-14 08:27:26,628 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 08:27:26,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:27:26,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-14 08:27:26,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317031994] [2022-12-14 08:27:26,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:27:26,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 08:27:26,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:27:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 08:27:26,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 08:27:26,629 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 08:27:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:27:26,866 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2022-12-14 08:27:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 08:27:26,867 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2022-12-14 08:27:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:27:26,867 INFO L225 Difference]: With dead ends: 122 [2022-12-14 08:27:26,867 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 08:27:26,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 170 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 08:27:26,868 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:27:26,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 101 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:27:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 08:27:26,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 08:27:26,868 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-12-14 08:27:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 08:27:26,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-12-14 08:27:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:27:26,869 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 08:27:26,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 08:27:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 08:27:26,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-12-14 08:27:26,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-12-14 08:27:26,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-12-14 08:27:26,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-12-14 08:27:26,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-12-14 08:27:26,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 08:27:27,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:27:27,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 08:27:30,976 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-12-14 08:27:30,976 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2022-12-14 08:27:30,976 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select |#memory_int| 1))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_circular_create_~data#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8))) (= (select .cse1 4) 0) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (= (select .cse2 0) 48) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse1 0) 0) (= (select .cse2 1) 0) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 08:27:30,976 INFO L899 garLoopResultBuilder]: For program point L622-1(line 622) no Hoare annotation was computed. [2022-12-14 08:27:30,976 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-12-14 08:27:30,976 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 626 645) the Hoare annotation is: true [2022-12-14 08:27:30,976 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-12-14 08:27:30,976 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point L631-3(line 631) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point L631-4(line 631) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L895 garLoopResultBuilder]: At program point L631-5(lines 631 634) the Hoare annotation is: (let ((.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse7 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (= |#NULL.offset| 0)) (.cse10 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse11 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse12 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse13 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse14 (<= 0 |#StackHeapBarrier|)) (.cse15 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse16 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse17 (= |#NULL.base| 0))) (or (let ((.cse0 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse6 .cse7 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse8 .cse9 .cse10 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse17)) (and (<= 2 |ULTIMATE.start_dll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 2) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse1 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse2 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse3 .cse4 .cse5 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 4) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 0 (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 2) (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 4) (<= |ULTIMATE.start_main_~new_data~0#1| 4) .cse6 .cse7 .cse8 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse9 .cse10 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) .cse11 (<= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse12 .cse13 .cse14 .cse15 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~index#1|) .cse16 .cse17))) [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point L615(line 615) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point L615-1(line 615) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point L632(line 632) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point L632-1(line 632) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-12-14 08:27:30,977 INFO L899 garLoopResultBuilder]: For program point L635-3(line 635) no Hoare annotation was computed. [2022-12-14 08:27:30,978 INFO L899 garLoopResultBuilder]: For program point L635-4(line 635) no Hoare annotation was computed. [2022-12-14 08:27:30,978 INFO L895 garLoopResultBuilder]: At program point L635-5(lines 635 640) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse4 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse13 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse15 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse16 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse17 (<= 0 |#StackHeapBarrier|)) (.cse18 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse19 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse20 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) .cse2 (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) .cse3 .cse4 .cse5 .cse6 (< |ULTIMATE.start_main_~i~0#1| 2147483647) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 |ULTIMATE.start_main_~expected~0#1|) .cse15 (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0)) (and (<= 2 |ULTIMATE.start_dll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 2) .cse0 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 4) (<= 0 (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 2) (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 4) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~new_data~0#1| 4) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse15 .cse16 .cse17 .cse18 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~index#1|) .cse19 .cse20))) [2022-12-14 08:27:30,978 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-12-14 08:27:30,978 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 08:27:30,978 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-12-14 08:27:30,978 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 08:27:30,978 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-12-14 08:27:30,978 INFO L899 garLoopResultBuilder]: For program point L636(line 636) no Hoare annotation was computed. [2022-12-14 08:27:30,978 INFO L899 garLoopResultBuilder]: For program point L636-1(line 636) no Hoare annotation was computed. [2022-12-14 08:27:30,978 INFO L899 garLoopResultBuilder]: For program point L595(line 595) no Hoare annotation was computed. [2022-12-14 08:27:30,978 INFO L899 garLoopResultBuilder]: For program point L595-1(line 595) no Hoare annotation was computed. [2022-12-14 08:27:30,978 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-12-14 08:27:30,979 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse7 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (= |#NULL.offset| 0)) (.cse10 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse11 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse12 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse13 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse14 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse17 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~index#1|)) (.cse18 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse19 (= |#NULL.base| 0))) (or (let ((.cse0 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (and (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse6 .cse7 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_dll_circular_update_at_~index#1|) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse8 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse9 .cse10 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|) .cse19)) (and (<= 2 |ULTIMATE.start_dll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 2) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse1 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse2 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse3 .cse4 .cse5 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 4) (<= 0 (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 2) (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 4) (<= |ULTIMATE.start_main_~new_data~0#1| 4) .cse6 .cse7 .cse8 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse9 .cse10 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) .cse11 (<= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2022-12-14 08:27:30,979 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-12-14 08:27:30,979 INFO L895 garLoopResultBuilder]: At program point L637(lines 637 639) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_#t~ret17#1| 2147483647)) (.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse4 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse8 (<= 0 (+ |ULTIMATE.start_main_#t~ret17#1| 2147483648))) (.cse9 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse10 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse11 (= |ULTIMATE.start_main_#t~ret17#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse14 (= |#NULL.offset| 0)) (.cse15 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse16 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse17 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse18 (<= 2 |ULTIMATE.start_main_~expected~0#1|)) (.cse19 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse20 (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (.cse21 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse24 (= |#NULL.base| 0)) (.cse25 (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (.cse26 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))) (or (and .cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| 4) .cse1 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|) .cse22 (<= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse23 .cse24 .cse25 .cse26) (and (<= 2 |ULTIMATE.start_dll_circular_update_at_#in~data#1|) .cse0 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 2) (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 4) .cse8 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= 0 (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 2) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 4) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~new_data~0#1| 4) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) .cse17 .cse18 (<= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse19 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) .cse20 .cse21 .cse22 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~index#1|) .cse23 .cse24 .cse25 .cse26))) [2022-12-14 08:27:30,979 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-12-14 08:27:30,979 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |#NULL.offset| 0)) (.cse5 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse8 (= |#NULL.base| 0))) (or (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (select |#memory_int| 1))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) .cse1 (= |ULTIMATE.start_dll_circular_create_~data#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8))) (= (select .cse2 4) 0) (= (select |#valid| 0) 0) .cse3 (= (select |#valid| 2) 1) .cse4 .cse5 (= (select .cse6 0) 48) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse2 0) 0) (= (select .cse6 1) 0) .cse7 (< 0 |#StackHeapBarrier|) .cse8)) (and (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse1 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) .cse3 .cse4 .cse5 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse7 (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse8))) [2022-12-14 08:27:30,979 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-12-14 08:27:30,979 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse4 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse13 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse15 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse16 (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (.cse17 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse18 (<= 0 |#StackHeapBarrier|)) (.cse19 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse20 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse21 (= |#NULL.base| 0)) (.cse22 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))) (or (and (<= 2 |ULTIMATE.start_dll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 2) .cse0 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 4) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= 0 (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 2) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 4) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~new_data~0#1| 4) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) .cse14 (<= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse15 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) .cse16 .cse17 .cse18 .cse19 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~index#1|) .cse20 .cse21 .cse22) (and .cse0 (<= |ULTIMATE.start_main_~expected~0#1| 4) .cse1 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 2) .cse7 .cse8 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 |ULTIMATE.start_main_~expected~0#1|) .cse15 .cse16 .cse17 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|) .cse18 .cse19 .cse20 .cse21 .cse22))) [2022-12-14 08:27:30,979 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-12-14 08:27:30,979 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-12-14 08:27:30,980 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (or (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse1 (not (< 0 |#StackHeapBarrier|))) (.cse2 (not (= |#NULL.base| 0)))) (and (or .cse0 .cse1 .cse2 (forall ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28|) 8)) (.cse4 (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28|)) (.cse5 (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28|))) (or (not (= .cse3 |node_create_#in~data#1|)) (not (= 0 (select .cse4 0))) (not (< |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28| |#StackHeapBarrier|)) (= |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28| 0) (not (= .cse3 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28|) 1)) (not (= (select |old(#length)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28|) 12)) (not (= (select .cse5 0) 0)) (not (= (select .cse4 4) 0)) (not (= (select .cse5 4) 0)))))) (let ((.cse6 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 .cse1 .cse2 (not (= |node_create_#in~data#1| 1)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse6 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse6 1) 0)) (not (= 19 (select |old(#length)| 2))))))) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-12-14 08:27:30,980 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-12-14 08:27:30,982 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:27:30,984 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 08:27:30,990 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:30,991 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:30,991 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:30,991 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:30,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:30,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:30,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:30,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,007 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 08:27:31 BoogieIcfgContainer [2022-12-14 08:27:31,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 08:27:31,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 08:27:31,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 08:27:31,011 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 08:27:31,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:26:18" (3/4) ... [2022-12-14 08:27:31,014 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 08:27:31,018 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-12-14 08:27:31,021 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2022-12-14 08:27:31,021 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-12-14 08:27:31,021 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 08:27:31,021 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 08:27:31,038 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && 2 == unknown-#length-unknown[1]) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && data == 1) && data == unknown-#memory_int-unknown[head][head + 8]) && #memory_$Pointer$[head][4] == 0) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && 1 <= data) && unknown-#memory_int-unknown[1][0] == 48) && head == last) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) [2022-12-14 08:27:31,039 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && i == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= \old(data)) && \result == s) && len == 2) && #NULL == 0) && 1 <= data) && #memory_$Pointer$[last][last] == head) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && \result == head) && #NULL == 0) || ((((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && 2 <= data) && 2 <= \old(len)) && 1 <= i) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data <= 4) && i <= 2) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && \old(data) <= 4) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) [2022-12-14 08:27:31,039 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((0 <= s && 2 <= \old(len)) && 1 <= i) && 2 <= \result) && 0 <= \old(index)) && 1 <= len) && 0 <= index) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i < 2147483647) && index <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= expected) && len <= 1) && 0 <= head) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && head <= 0) || ((((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && 2 <= data) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i <= 0) && data <= 4) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && \old(data) <= 4) && 0 <= i) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) [2022-12-14 08:27:31,039 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((\old(data) == data && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= \old(data)) && \result == s) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && len == 2) && head == s) && #NULL == 0) && 1 <= data) && s == head) && #memory_$Pointer$[last][last] == head) && \old(len) <= 2) && len <= 1) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && \result == head) && \old(data) == new_data) && #NULL == 0) || ((((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && 2 <= data) && 2 <= \old(len)) && 1 <= i) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data <= 4) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && \old(data) <= 4) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) [2022-12-14 08:27:31,039 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && i == 0) && 2 <= data) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data <= 4) && len + i == expected) && 0 <= index + 1) && head <= 0) && index == 0) && \old(index) <= 2) && s == head) && \old(data) <= 4) && \old(index) == i) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && head == head) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && head == head) && 0 <= head) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) && head <= 0) || (((((((((((((((((((((((((((((0 <= s && expected <= 4) && 2 <= \old(len)) && 1 <= i) && 0 <= \old(index)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) <= 2) && data == 1) && 1 <= \old(data)) && index <= 2) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= expected) && len <= 1) && 0 <= head) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && head <= 0) [2022-12-14 08:27:31,039 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= s) && expected <= 4) && 2 <= \old(len)) && 1 <= i) && 0 <= \old(index)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && \old(index) <= 2) && data == 1) && 1 <= \old(data)) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= expected) && len <= 1) && 0 <= head) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && head <= 0) || (((((((((((((((((((((((((((((((((((((((((((((2 <= \old(data) && aux-dll_circular_get_data_at(s, i)-aux <= 2147483647) && index <= 2) && 0 <= head) && 2 <= data) && \old(index) == index) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && data <= 4) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && s == head) && head == s) && \old(data) <= 4) && \old(index) == i) && new_data <= 4) && data == 1) && 1 <= \old(data)) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && head == head) && \old(len) <= 2) && 2 <= expected) && 2 <= new_data) && len <= 1) && head == head) && 0 <= head) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && head <= 0) [2022-12-14 08:27:31,047 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 08:27:31,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 08:27:31,048 INFO L158 Benchmark]: Toolchain (without parser) took 73497.81ms. Allocated memory was 119.5MB in the beginning and 209.7MB in the end (delta: 90.2MB). Free memory was 79.5MB in the beginning and 130.5MB in the end (delta: -51.1MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-12-14 08:27:31,048 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 08:27:31,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.03ms. Allocated memory is still 119.5MB. Free memory was 79.1MB in the beginning and 62.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 08:27:31,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.62ms. Allocated memory is still 119.5MB. Free memory was 62.0MB in the beginning and 59.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:27:31,048 INFO L158 Benchmark]: Boogie Preprocessor took 21.25ms. Allocated memory is still 119.5MB. Free memory was 59.5MB in the beginning and 57.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:27:31,048 INFO L158 Benchmark]: RCFGBuilder took 420.03ms. Allocated memory is still 119.5MB. Free memory was 57.8MB in the beginning and 85.4MB in the end (delta: -27.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2022-12-14 08:27:31,048 INFO L158 Benchmark]: TraceAbstraction took 72710.20ms. Allocated memory was 119.5MB in the beginning and 209.7MB in the end (delta: 90.2MB). Free memory was 84.7MB in the beginning and 134.7MB in the end (delta: -50.1MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. [2022-12-14 08:27:31,048 INFO L158 Benchmark]: Witness Printer took 36.29ms. Allocated memory is still 209.7MB. Free memory was 134.7MB in the beginning and 130.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 08:27:31,049 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.14ms. Allocated memory is still 119.5MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.03ms. Allocated memory is still 119.5MB. Free memory was 79.1MB in the beginning and 62.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.62ms. Allocated memory is still 119.5MB. Free memory was 62.0MB in the beginning and 59.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.25ms. Allocated memory is still 119.5MB. Free memory was 59.5MB in the beginning and 57.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 420.03ms. Allocated memory is still 119.5MB. Free memory was 57.8MB in the beginning and 85.4MB in the end (delta: -27.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 72710.20ms. Allocated memory was 119.5MB in the beginning and 209.7MB in the end (delta: 90.2MB). Free memory was 84.7MB in the beginning and 134.7MB in the end (delta: -50.1MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. * Witness Printer took 36.29ms. Allocated memory is still 209.7MB. Free memory was 134.7MB in the beginning and 130.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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$.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$.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$.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$.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$.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$.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$.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: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: 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: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: 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 2 procedures, 48 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 72.6s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 654 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 652 mSDsluCounter, 1918 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1345 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3370 IncrementalHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 573 mSDtfsCounter, 3370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1257 GetRequests, 824 SyntacticMatches, 90 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3527 ImplicationChecksByTransitivity, 42.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=22, InterpolantAutomatonStates: 202, 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, 23 MinimizatonAttempts, 155 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 42 NumberOfFragments, 1678 HoareAnnotationTreeSize, 16 FomulaSimplifications, 10129 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 12 FomulaSimplificationsInter, 7230 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1092 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1379 ConstructedInterpolants, 0 QuantifiedInterpolants, 3109 SizeOfPredicates, 28 NumberOfNonLiveVariables, 4044 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 43 InterpolantComputations, 15 PerfectInterpolantSequences, 568/733 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: 10.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 161, DAG_INTERPRETER_EARLY_EXITS: 12, TOOLS_POST_APPLICATIONS: 385, TOOLS_POST_TIME: 5.3s, TOOLS_POST_CALL_APPLICATIONS: 48, TOOLS_POST_CALL_TIME: 1.9s, TOOLS_POST_RETURN_APPLICATIONS: 36, TOOLS_POST_RETURN_TIME: 1.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 469, TOOLS_QUANTIFIERELIM_TIME: 8.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 717, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 70, DOMAIN_JOIN_TIME: 0.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 12, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 45, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 161, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 33, LOOP_SUMMARIZER_CACHE_MISSES: 33, LOOP_SUMMARIZER_OVERALL_TIME: 2.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 45, CALL_SUMMARIZER_APPLICATIONS: 36, CALL_SUMMARIZER_CACHE_MISSES: 6, CALL_SUMMARIZER_OVERALL_TIME: 0.2s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 4145, DAG_COMPRESSION_RETAINED_NODES: 555, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant [2022-12-14 08:27:31,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((((((\old(data) == data && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= \old(data)) && \result == s) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && len == 2) && head == s) && #NULL == 0) && 1 <= data) && s == head) && #memory_$Pointer$[last][last] == head) && \old(len) <= 2) && len <= 1) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && \result == head) && \old(data) == new_data) && #NULL == 0) || ((((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && 2 <= data) && 2 <= \old(len)) && 1 <= i) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data <= 4) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && \old(data) <= 4) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= s) && expected <= 4) && 2 <= \old(len)) && 1 <= i) && 0 <= \old(index)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && \old(index) <= 2) && data == 1) && 1 <= \old(data)) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= expected) && len <= 1) && 0 <= head) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && head <= 0) || (((((((((((((((((((((((((((((((((((((((((((((2 <= \old(data) && aux-dll_circular_get_data_at(s, i)-aux <= 2147483647) && index <= 2) && 0 <= head) && 2 <= data) && \old(index) == index) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && data <= 4) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && s == head) && head == s) && \old(data) <= 4) && \old(index) == i) && new_data <= 4) && data == 1) && 1 <= \old(data)) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && head == head) && \old(len) <= 2) && 2 <= expected) && 2 <= new_data) && len <= 1) && head == head) && 0 <= head) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && head <= 0) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-12-14 08:27:31,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,057 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,058 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && i == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && last <= 0) && \result == head) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= \old(data)) && \result == s) && len == 2) && #NULL == 0) && 1 <= data) && #memory_$Pointer$[last][last] == head) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && \result == head) && #NULL == 0) || ((((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && 2 <= data) && 2 <= \old(len)) && 1 <= i) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data <= 4) && i <= 2) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && \old(data) <= 4) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((0 <= s && 2 <= \old(len)) && 1 <= i) && 2 <= \result) && 0 <= \old(index)) && 1 <= len) && 0 <= index) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i < 2147483647) && index <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= expected) && len <= 1) && 0 <= head) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && head <= 0) || ((((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && 2 <= data) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i <= 0) && data <= 4) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && \old(data) <= 4) && 0 <= i) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 588]: Loop Invariant [2022-12-14 08:27:31,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 08:27:31,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 08:27:31,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && 2 == unknown-#length-unknown[1]) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && data == 1) && data == unknown-#memory_int-unknown[head][head + 8]) && #memory_$Pointer$[head][4] == 0) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && 1 <= data) && unknown-#memory_int-unknown[1][0] == 48) && head == last) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && i == 0) && 2 <= data) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data <= 4) && len + i == expected) && 0 <= index + 1) && head <= 0) && index == 0) && \old(index) <= 2) && s == head) && \old(data) <= 4) && \old(index) == i) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && head == head) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && head == head) && 0 <= head) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) && head <= 0) || (((((((((((((((((((((((((((((0 <= s && expected <= 4) && 2 <= \old(len)) && 1 <= i) && 0 <= \old(index)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) <= 2) && data == 1) && 1 <= \old(data)) && index <= 2) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= expected) && len <= 1) && 0 <= head) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && head <= 0) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 08:27:31,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c163ec89-dee7-4b40-9b92-d0b63d15964d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE