./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:35:46,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:35:46,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:35:46,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:35:46,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:35:46,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:35:46,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:35:46,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:35:46,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:35:46,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:35:46,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:35:46,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:35:46,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:35:46,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:35:46,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:35:46,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:35:46,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:35:46,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:35:46,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:35:46,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:35:46,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:35:46,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:35:46,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:35:46,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:35:46,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:35:46,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:35:46,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:35:46,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:35:46,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:35:46,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:35:46,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:35:46,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:35:46,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:35:46,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:35:46,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:35:46,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:35:46,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:35:46,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:35:46,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:35:46,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:35:46,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:35:46,394 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 00:35:46,416 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:35:46,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:35:46,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:35:46,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:35:46,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:35:46,418 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:35:46,418 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:35:46,419 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:35:46,419 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:35:46,419 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:35:46,420 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:35:46,420 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:35:46,420 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:35:46,420 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:35:46,420 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:35:46,421 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:35:46,421 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:35:46,421 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:35:46,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:35:46,422 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:35:46,423 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:35:46,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:35:46,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:35:46,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:35:46,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:35:46,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:35:46,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:35:46,424 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:35:46,425 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:35:46,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:35:46,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:35:46,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:35:46,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:35:46,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:35:46,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:35:46,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:35:46,427 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:35:46,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:35:46,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:35:46,427 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:35:46,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:35:46,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:35:46,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:35:46,428 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_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2022-11-26 00:35:46,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:35:46,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:35:46,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:35:46,731 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:35:46,731 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:35:46,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-11-26 00:35:49,868 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:35:50,128 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:35:50,129 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-11-26 00:35:50,141 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/data/a727e232f/2121e1135800449fbefffb59c9006d40/FLAG1e5a014c1 [2022-11-26 00:35:50,157 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/data/a727e232f/2121e1135800449fbefffb59c9006d40 [2022-11-26 00:35:50,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:35:50,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:35:50,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:35:50,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:35:50,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:35:50,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563b527f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50, skipping insertion in model container [2022-11-26 00:35:50,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:35:50,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:35:50,535 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_6a062a19-1126-498c-9dd8-d403536bc00e/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2022-11-26 00:35:50,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:35:50,558 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:35:50,647 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_6a062a19-1126-498c-9dd8-d403536bc00e/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2022-11-26 00:35:50,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:35:50,682 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:35:50,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50 WrapperNode [2022-11-26 00:35:50,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:35:50,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:35:50,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:35:50,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:35:50,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,765 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2022-11-26 00:35:50,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:35:50,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:35:50,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:35:50,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:35:50,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,816 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:35:50,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:35:50,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:35:50,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:35:50,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (1/1) ... [2022-11-26 00:35:50,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:35:50,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:35:50,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:35:50,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:35:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:35:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:35:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-26 00:35:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-26 00:35:50,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:35:50,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:35:50,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:35:50,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:35:50,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:35:50,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:35:50,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:35:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:35:51,141 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:35:51,158 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:35:51,443 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:35:51,494 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:35:51,495 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-26 00:35:51,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:35:51 BoogieIcfgContainer [2022-11-26 00:35:51,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:35:51,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:35:51,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:35:51,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:35:51,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:35:50" (1/3) ... [2022-11-26 00:35:51,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786e8ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:35:51, skipping insertion in model container [2022-11-26 00:35:51,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:35:50" (2/3) ... [2022-11-26 00:35:51,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786e8ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:35:51, skipping insertion in model container [2022-11-26 00:35:51,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:35:51" (3/3) ... [2022-11-26 00:35:51,509 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2022-11-26 00:35:51,572 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:35:51,572 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-26 00:35:51,628 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:35:51,638 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;@475c145b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:35:51,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-26 00:35:51,646 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-11-26 00:35:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:35:51,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:51,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:51,656 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-11-26 00:35:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:51,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1414268203, now seen corresponding path program 1 times [2022-11-26 00:35:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:51,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900024287] [2022-11-26 00:35:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:35:52,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:52,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900024287] [2022-11-26 00:35:52,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900024287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:52,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:35:52,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:35:52,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79709370] [2022-11-26 00:35:52,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:52,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:35:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:35:52,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:35:52,120 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-11-26 00:35:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:52,191 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-11-26 00:35:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:35:52,195 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-11-26 00:35:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:52,203 INFO L225 Difference]: With dead ends: 89 [2022-11-26 00:35:52,204 INFO L226 Difference]: Without dead ends: 49 [2022-11-26 00:35:52,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:35:52,211 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-11-26 00:35:52,213 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-11-26 00:35:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-26 00:35:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-11-26 00:35:52,258 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-11-26 00:35:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-11-26 00:35:52,262 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2022-11-26 00:35:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:52,263 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-11-26 00:35:52,263 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-11-26 00:35:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-11-26 00:35:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:35:52,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:52,265 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:52,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:35:52,266 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-11-26 00:35:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:52,267 INFO L85 PathProgramCache]: Analyzing trace with hash -955466361, now seen corresponding path program 1 times [2022-11-26 00:35:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:52,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195566854] [2022-11-26 00:35:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:35:52,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:52,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195566854] [2022-11-26 00:35:52,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195566854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:52,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:35:52,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:35:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028234961] [2022-11-26 00:35:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:52,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:35:52,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:52,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:35:52,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:35:52,558 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-11-26 00:35:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:52,667 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-11-26 00:35:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:35:52,669 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-11-26 00:35:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:52,671 INFO L225 Difference]: With dead ends: 49 [2022-11-26 00:35:52,671 INFO L226 Difference]: Without dead ends: 48 [2022-11-26 00:35:52,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:35:52,673 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:52,674 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.1s Time] [2022-11-26 00:35:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-26 00:35:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-11-26 00:35:52,688 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-11-26 00:35:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-11-26 00:35:52,693 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 13 [2022-11-26 00:35:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:52,694 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-11-26 00:35:52,694 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-11-26 00:35:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-11-26 00:35:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:35:52,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:52,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:52,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:35:52,696 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-11-26 00:35:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash 445313930, now seen corresponding path program 1 times [2022-11-26 00:35:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:52,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294742933] [2022-11-26 00:35:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:35:52,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:52,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294742933] [2022-11-26 00:35:52,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294742933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:52,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:35:52,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:35:52,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683271998] [2022-11-26 00:35:52,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:52,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:35:52,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:52,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:35:52,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:35:52,860 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-11-26 00:35:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:52,913 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-26 00:35:52,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:35:52,913 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-11-26 00:35:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:52,914 INFO L225 Difference]: With dead ends: 48 [2022-11-26 00:35:52,915 INFO L226 Difference]: Without dead ends: 47 [2022-11-26 00:35:52,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:35:52,917 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-11-26 00:35:52,917 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-11-26 00:35:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-26 00:35:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-26 00:35:52,924 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-11-26 00:35:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-26 00:35:52,925 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 14 [2022-11-26 00:35:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:52,926 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-26 00:35:52,926 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-11-26 00:35:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-26 00:35:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:35:52,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:52,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:52,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:35:52,928 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-11-26 00:35:52,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash -806494496, now seen corresponding path program 1 times [2022-11-26 00:35:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:52,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960399758] [2022-11-26 00:35:52,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:35:53,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:53,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960399758] [2022-11-26 00:35:53,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960399758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:53,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:35:53,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:35:53,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809411153] [2022-11-26 00:35:53,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:53,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:35:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:35:53,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:35:53,127 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-11-26 00:35:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:53,245 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-11-26 00:35:53,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:35:53,245 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-11-26 00:35:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:53,247 INFO L225 Difference]: With dead ends: 76 [2022-11-26 00:35:53,247 INFO L226 Difference]: Without dead ends: 74 [2022-11-26 00:35:53,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:35:53,249 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:53,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 88 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:35:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-26 00:35:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2022-11-26 00:35:53,256 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-11-26 00:35:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-11-26 00:35:53,257 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2022-11-26 00:35:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:53,258 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-11-26 00:35:53,258 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-11-26 00:35:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-11-26 00:35:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:35:53,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:53,260 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:53,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:35:53,260 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-11-26 00:35:53,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:53,261 INFO L85 PathProgramCache]: Analyzing trace with hash 768474467, now seen corresponding path program 1 times [2022-11-26 00:35:53,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:53,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431237475] [2022-11-26 00:35:53,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:35:53,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:53,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431237475] [2022-11-26 00:35:53,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431237475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:53,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12410015] [2022-11-26 00:35:53,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:53,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:53,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:35:53,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:35:53,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:35:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:53,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:35:53,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:35:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:35:53,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:35:53,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12410015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:53,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:35:53,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-26 00:35:53,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884133205] [2022-11-26 00:35:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:53,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:35:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:53,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:35:53,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:35:53,775 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-11-26 00:35:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:53,854 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-11-26 00:35:53,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:35:53,854 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-11-26 00:35:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:53,857 INFO L225 Difference]: With dead ends: 74 [2022-11-26 00:35:53,858 INFO L226 Difference]: Without dead ends: 72 [2022-11-26 00:35:53,860 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-11-26 00:35:53,863 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 58 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:53,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 59 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:35:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-26 00:35:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-11-26 00:35:53,885 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-11-26 00:35:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-11-26 00:35:53,888 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2022-11-26 00:35:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:53,889 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-11-26 00:35:53,889 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-11-26 00:35:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-11-26 00:35:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:35:53,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:53,895 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:53,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:35:54,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:54,103 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:35:54,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:54,104 INFO L85 PathProgramCache]: Analyzing trace with hash -230405773, now seen corresponding path program 1 times [2022-11-26 00:35:54,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:54,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641688448] [2022-11-26 00:35:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:35:54,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:54,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641688448] [2022-11-26 00:35:54,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641688448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:54,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:35:54,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:35:54,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202473890] [2022-11-26 00:35:54,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:54,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:35:54,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:35:54,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:35:54,187 INFO L87 Difference]: Start difference. First operand 53 states and 60 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-11-26 00:35:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:54,280 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-11-26 00:35:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:35:54,281 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-11-26 00:35:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:54,282 INFO L225 Difference]: With dead ends: 72 [2022-11-26 00:35:54,282 INFO L226 Difference]: Without dead ends: 70 [2022-11-26 00:35:54,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:35:54,283 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:54,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 90 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:35:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-26 00:35:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2022-11-26 00:35:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.55) internal successors, (62), 53 states have internal predecessors, (62), 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-11-26 00:35:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-11-26 00:35:54,292 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 20 [2022-11-26 00:35:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:54,293 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-11-26 00:35:54,293 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-11-26 00:35:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-11-26 00:35:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:35:54,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:54,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:54,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:35:54,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:35:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash -230409691, now seen corresponding path program 1 times [2022-11-26 00:35:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:54,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037600318] [2022-11-26 00:35:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:35:54,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:54,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037600318] [2022-11-26 00:35:54,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037600318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:54,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:35:54,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:35:54,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571451389] [2022-11-26 00:35:54,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:54,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:35:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:35:54,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:35:54,395 INFO L87 Difference]: Start difference. First operand 58 states and 68 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-11-26 00:35:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:54,491 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2022-11-26 00:35:54,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:35:54,492 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-11-26 00:35:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:54,493 INFO L225 Difference]: With dead ends: 136 [2022-11-26 00:35:54,493 INFO L226 Difference]: Without dead ends: 99 [2022-11-26 00:35:54,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:35:54,494 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:54,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 116 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:35:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-26 00:35:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 56. [2022-11-26 00:35:54,502 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-11-26 00:35:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-11-26 00:35:54,503 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 20 [2022-11-26 00:35:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:54,503 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-11-26 00:35:54,503 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-11-26 00:35:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-11-26 00:35:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:35:54,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:54,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:54,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:35:54,505 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-11-26 00:35:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1269849070, now seen corresponding path program 1 times [2022-11-26 00:35:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:54,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054106846] [2022-11-26 00:35:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:35:54,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:54,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054106846] [2022-11-26 00:35:54,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054106846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:54,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:35:54,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:35:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479554954] [2022-11-26 00:35:54,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:54,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:35:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:35:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:35:54,579 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-11-26 00:35:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:54,624 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-11-26 00:35:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:35:54,625 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-11-26 00:35:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:54,626 INFO L225 Difference]: With dead ends: 56 [2022-11-26 00:35:54,626 INFO L226 Difference]: Without dead ends: 55 [2022-11-26 00:35:54,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:35:54,629 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-11-26 00:35:54,629 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-11-26 00:35:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-26 00:35:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-26 00:35:54,651 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-11-26 00:35:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-11-26 00:35:54,655 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2022-11-26 00:35:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:54,657 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-11-26 00:35:54,658 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-11-26 00:35:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-11-26 00:35:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:35:54,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:54,659 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-11-26 00:35:54,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:35:54,660 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-11-26 00:35:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1054413508, now seen corresponding path program 1 times [2022-11-26 00:35:54,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:54,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300407656] [2022-11-26 00:35:54,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:35:54,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:54,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300407656] [2022-11-26 00:35:54,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300407656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:54,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:35:54,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:35:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269830804] [2022-11-26 00:35:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:54,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:35:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:35:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:35:54,768 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-11-26 00:35:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:54,854 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-11-26 00:35:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:35:54,855 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-11-26 00:35:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:54,856 INFO L225 Difference]: With dead ends: 81 [2022-11-26 00:35:54,856 INFO L226 Difference]: Without dead ends: 66 [2022-11-26 00:35:54,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:35:54,859 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:54,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 94 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:35:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-26 00:35:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-11-26 00:35:54,874 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-11-26 00:35:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-11-26 00:35:54,875 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 21 [2022-11-26 00:35:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:54,875 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-11-26 00:35:54,875 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-11-26 00:35:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-11-26 00:35:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:35:54,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:54,879 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:54,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:35:54,880 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-11-26 00:35:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash -710615457, now seen corresponding path program 1 times [2022-11-26 00:35:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:54,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530385086] [2022-11-26 00:35:54,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 00:35:55,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:55,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530385086] [2022-11-26 00:35:55,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530385086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:55,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513807810] [2022-11-26 00:35:55,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:55,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:55,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:35:55,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:35:55,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:35:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:55,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:35:55,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:35:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:35:55,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:35:55,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513807810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:55,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:35:55,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-26 00:35:55,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836979624] [2022-11-26 00:35:55,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:55,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:35:55,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:55,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:35:55,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:35:55,267 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-11-26 00:35:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:55,313 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-11-26 00:35:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:35:55,314 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-11-26 00:35:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:55,315 INFO L225 Difference]: With dead ends: 99 [2022-11-26 00:35:55,315 INFO L226 Difference]: Without dead ends: 51 [2022-11-26 00:35:55,316 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-11-26 00:35:55,341 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-11-26 00:35:55,342 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-11-26 00:35:55,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-26 00:35:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-26 00:35:55,354 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-11-26 00:35:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-26 00:35:55,356 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 22 [2022-11-26 00:35:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:55,357 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-26 00:35:55,357 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-11-26 00:35:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-26 00:35:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:35:55,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:55,361 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-11-26 00:35:55,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:35:55,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 00:35:55,568 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-11-26 00:35:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1672833769, now seen corresponding path program 1 times [2022-11-26 00:35:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:55,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786194726] [2022-11-26 00:35:55,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:35:55,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:55,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786194726] [2022-11-26 00:35:55,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786194726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:55,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:35:55,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:35:55,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704538889] [2022-11-26 00:35:55,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:55,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:35:55,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:55,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:35:55,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:35:55,644 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-11-26 00:35:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:55,713 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-11-26 00:35:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:35:55,714 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-11-26 00:35:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:55,715 INFO L225 Difference]: With dead ends: 56 [2022-11-26 00:35:55,715 INFO L226 Difference]: Without dead ends: 54 [2022-11-26 00:35:55,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:35:55,716 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:55,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:35:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-26 00:35:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-26 00:35:55,722 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-11-26 00:35:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-11-26 00:35:55,723 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 22 [2022-11-26 00:35:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:55,724 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-11-26 00:35:55,724 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-11-26 00:35:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-11-26 00:35:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:35:55,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:55,727 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-11-26 00:35:55,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:35:55,727 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-11-26 00:35:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash -660554005, now seen corresponding path program 1 times [2022-11-26 00:35:55,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:55,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734557188] [2022-11-26 00:35:55,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:55,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:35:55,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:55,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734557188] [2022-11-26 00:35:55,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734557188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:55,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529781355] [2022-11-26 00:35:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:55,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:55,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:35:55,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:35:55,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:35:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:56,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:35:56,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:35:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:35:56,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:35:56,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529781355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:56,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:35:56,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-26 00:35:56,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8328227] [2022-11-26 00:35:56,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:56,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:35:56,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:56,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:35:56,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:35:56,167 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-11-26 00:35:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:56,279 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-11-26 00:35:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:35:56,279 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-11-26 00:35:56,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:56,280 INFO L225 Difference]: With dead ends: 54 [2022-11-26 00:35:56,280 INFO L226 Difference]: Without dead ends: 52 [2022-11-26 00:35:56,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:35:56,281 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 51 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:56,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 72 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:35:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-26 00:35:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-26 00:35:56,286 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-11-26 00:35:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-11-26 00:35:56,287 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2022-11-26 00:35:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:56,287 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-11-26 00:35:56,288 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-11-26 00:35:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-11-26 00:35:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:35:56,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:56,289 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-11-26 00:35:56,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:35:56,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 00:35:56,495 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-11-26 00:35:56,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:56,495 INFO L85 PathProgramCache]: Analyzing trace with hash 997662392, now seen corresponding path program 1 times [2022-11-26 00:35:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:56,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628623627] [2022-11-26 00:35:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:56,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:35:56,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:56,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628623627] [2022-11-26 00:35:56,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628623627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:56,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748077142] [2022-11-26 00:35:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:56,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:56,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:35:56,686 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:35:56,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:35:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:56,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:35:56,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:35:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:35:56,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:35:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:35:57,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748077142] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:35:57,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [581942171] [2022-11-26 00:35:57,090 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-26 00:35:57,090 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:35:57,094 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:35:57,101 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:35:57,101 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:35:57,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:35:57,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:35:57,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:57,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:35:57,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:57,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:35:57,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:57,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:35:57,776 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-11-26 00:35:57,788 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-11-26 00:35:57,799 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-11-26 00:35:57,809 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-11-26 00:35:57,821 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-11-26 00:35:57,837 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:57,840 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:57,842 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:57,845 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:57,847 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:58,067 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-11-26 00:35:58,077 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-11-26 00:35:58,089 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-11-26 00:35:58,099 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-11-26 00:35:58,109 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-11-26 00:35:58,122 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:58,125 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:58,128 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:58,130 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:58,132 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:58,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:35:58,197 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:35:58,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:58,209 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:35:58,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:58,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2022-11-26 00:35:58,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:35:58,465 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 130 treesize of output 118 [2022-11-26 00:35:58,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:35:58,477 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 122 treesize of output 110 [2022-11-26 00:35:58,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:58,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 120 [2022-11-26 00:35:58,714 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 134 treesize of output 122 [2022-11-26 00:35:58,727 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 130 treesize of output 118 [2022-11-26 00:35:58,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:35:58,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:35:58,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:35:58,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:58,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:35:58,939 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-11-26 00:35:58,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:58,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:35:59,070 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:35:59,225 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-26 00:35:59,366 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:36:02,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [581942171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:36:02,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:36:02,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 5, 5] total 25 [2022-11-26 00:36:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549608584] [2022-11-26 00:36:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:36:02,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:36:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:36:02,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:36:02,044 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-11-26 00:36:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:03,276 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-11-26 00:36:03,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:36:03,279 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-11-26 00:36:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:03,280 INFO L225 Difference]: With dead ends: 82 [2022-11-26 00:36:03,280 INFO L226 Difference]: Without dead ends: 58 [2022-11-26 00:36:03,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2022-11-26 00:36:03,282 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:03,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 123 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:36:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-26 00:36:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-11-26 00:36:03,292 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-11-26 00:36:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-11-26 00:36:03,292 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 24 [2022-11-26 00:36:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:03,293 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-11-26 00:36:03,293 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-11-26 00:36:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-11-26 00:36:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 00:36:03,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:03,294 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-11-26 00:36:03,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:36:03,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 00:36:03,500 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-11-26 00:36:03,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash 975854138, now seen corresponding path program 1 times [2022-11-26 00:36:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:03,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984332954] [2022-11-26 00:36:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:03,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:36:03,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:03,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984332954] [2022-11-26 00:36:03,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984332954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:36:03,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:36:03,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:36:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598259512] [2022-11-26 00:36:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:36:03,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:36:03,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:03,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:36:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:36:03,576 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-11-26 00:36:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:03,606 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-11-26 00:36:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:36:03,607 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-11-26 00:36:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:03,607 INFO L225 Difference]: With dead ends: 56 [2022-11-26 00:36:03,608 INFO L226 Difference]: Without dead ends: 55 [2022-11-26 00:36:03,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:36:03,609 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:03,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 62 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:36:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-26 00:36:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-26 00:36:03,618 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-11-26 00:36:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-11-26 00:36:03,619 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 26 [2022-11-26 00:36:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:03,620 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-11-26 00:36:03,620 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-11-26 00:36:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-11-26 00:36:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:36:03,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:03,621 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-11-26 00:36:03,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-26 00:36:03,621 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-11-26 00:36:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 186707286, now seen corresponding path program 1 times [2022-11-26 00:36:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:03,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485914274] [2022-11-26 00:36:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:03,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:36:03,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:03,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485914274] [2022-11-26 00:36:03,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485914274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384357301] [2022-11-26 00:36:03,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:03,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:03,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:36:03,765 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:36:03,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:36:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:03,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:36:03,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:36:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:36:03,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:36:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:36:04,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384357301] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:36:04,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1794568554] [2022-11-26 00:36:04,090 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-26 00:36:04,090 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:36:04,090 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:36:04,091 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:36:04,091 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:36:04,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:36:04,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:36:04,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:04,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:36:04,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:04,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:36:04,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:04,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:36:04,461 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-11-26 00:36:04,470 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-11-26 00:36:04,481 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-11-26 00:36:04,490 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-11-26 00:36:04,499 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-11-26 00:36:04,509 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:04,511 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:04,512 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:04,515 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:04,517 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:04,712 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-11-26 00:36:04,721 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-11-26 00:36:04,731 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-11-26 00:36:04,740 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-11-26 00:36:04,749 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-11-26 00:36:04,760 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:04,762 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:04,764 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:04,766 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:04,768 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:04,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:04,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:04,865 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 189 treesize of output 173 [2022-11-26 00:36:04,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:04,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-26 00:36:04,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:04,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-11-26 00:36:05,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:05,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2022-11-26 00:36:05,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:05,139 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 130 treesize of output 118 [2022-11-26 00:36:05,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:05,151 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 126 treesize of output 114 [2022-11-26 00:36:05,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:05,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2022-11-26 00:36:05,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:05,373 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 130 treesize of output 118 [2022-11-26 00:36:05,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:05,387 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 126 treesize of output 114 [2022-11-26 00:36:05,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 11 treesize of output 7 [2022-11-26 00:36:05,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:36:05,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:36:05,568 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-11-26 00:36:05,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:05,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:36:05,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:05,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:36:05,689 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:05,909 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-26 00:36:06,011 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:36:09,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1794568554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:36:09,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:36:09,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6, 6, 6] total 26 [2022-11-26 00:36:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730495665] [2022-11-26 00:36:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:36:09,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:36:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:09,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:36:09,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:36:09,163 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-11-26 00:36:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:10,343 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-11-26 00:36:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:36:10,349 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-11-26 00:36:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:10,350 INFO L225 Difference]: With dead ends: 58 [2022-11-26 00:36:10,350 INFO L226 Difference]: Without dead ends: 57 [2022-11-26 00:36:10,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:36:10,352 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:10,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 115 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:36:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-26 00:36:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-26 00:36:10,361 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-11-26 00:36:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-26 00:36:10,361 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 27 [2022-11-26 00:36:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:10,362 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-26 00:36:10,362 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-11-26 00:36:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-26 00:36:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:36:10,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:10,363 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-11-26 00:36:10,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:36:10,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:10,569 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:36:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash 214305910, now seen corresponding path program 1 times [2022-11-26 00:36:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:10,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437174657] [2022-11-26 00:36:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:36:10,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:10,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437174657] [2022-11-26 00:36:10,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437174657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:10,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167206553] [2022-11-26 00:36:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:10,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:10,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:36:10,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:36:10,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:36:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:10,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:36:10,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:36:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:36:11,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:36:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:36:11,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167206553] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:36:11,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [674167640] [2022-11-26 00:36:11,097 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-26 00:36:11,097 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:36:11,098 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:36:11,098 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:36:11,098 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:36:11,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:36:11,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:36:11,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:11,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:36:11,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:11,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:36:11,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:11,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:36:11,289 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-11-26 00:36:11,301 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-11-26 00:36:11,312 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-11-26 00:36:11,322 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-11-26 00:36:11,331 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-11-26 00:36:11,365 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-11-26 00:36:11,374 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-11-26 00:36:11,383 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-11-26 00:36:11,393 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-11-26 00:36:11,402 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-11-26 00:36:11,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:11,458 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:11,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:11,475 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:36:11,757 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-11-26 00:36:11,767 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-11-26 00:36:11,777 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-11-26 00:36:11,788 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-11-26 00:36:11,798 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-11-26 00:36:11,811 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:11,814 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:11,816 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:11,818 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:11,821 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,031 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-11-26 00:36:12,040 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-11-26 00:36:12,048 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-11-26 00:36:12,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 7 treesize of output 3 [2022-11-26 00:36:12,067 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-11-26 00:36:12,079 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,081 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,082 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,085 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,087 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,125 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:12,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:12,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:12,150 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:36:12,374 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,376 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,379 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,380 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,383 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,393 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-11-26 00:36:12,402 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-11-26 00:36:12,411 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-11-26 00:36:12,420 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-11-26 00:36:12,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-11-26 00:36:12,693 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,695 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,697 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,700 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,702 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:36:12,712 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-11-26 00:36:12,721 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-11-26 00:36:12,730 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-11-26 00:36:12,742 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-11-26 00:36:12,751 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-11-26 00:36:12,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:12,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:12,833 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 189 treesize of output 173 [2022-11-26 00:36:12,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:12,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-26 00:36:12,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:12,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-11-26 00:36:13,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:36:13,026 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:36:13,026 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:36:13,052 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:36:13,053 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:36:13,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:13,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:13,178 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:36:13,178 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 34 treesize of output 21 [2022-11-26 00:36:13,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:13,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:13,209 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:36:13,210 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 34 treesize of output 21 [2022-11-26 00:36:13,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:13,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:13,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-26 00:36:13,847 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-26 00:36:13,847 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 1 case distinctions, treesize of input 360 treesize of output 357 [2022-11-26 00:36:13,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:13,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:13,927 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-26 00:36:13,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 332 [2022-11-26 00:36:13,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:13,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:14,002 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-26 00:36:14,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 332 [2022-11-26 00:36:14,457 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-26 00:36:14,458 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 1 case distinctions, treesize of input 155 treesize of output 149 [2022-11-26 00:36:14,493 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-26 00:36:14,493 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 1 case distinctions, treesize of input 151 treesize of output 145 [2022-11-26 00:36:14,588 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-11-26 00:36:15,139 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-26 00:36:15,291 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:36:20,652 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3216#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_update_at_~index#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (< 2147483646 |ULTIMATE.start_main_#t~post15#1|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= 2 |ULTIMATE.start_sll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-26 00:36:20,652 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:36:20,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:36:20,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-11-26 00:36:20,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529614504] [2022-11-26 00:36:20,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:36:20,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:36:20,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:20,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:36:20,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-11-26 00:36:20,655 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 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-11-26 00:36:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:21,006 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-11-26 00:36:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:36:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 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 30 [2022-11-26 00:36:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:21,007 INFO L225 Difference]: With dead ends: 86 [2022-11-26 00:36:21,007 INFO L226 Difference]: Without dead ends: 85 [2022-11-26 00:36:21,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2022-11-26 00:36:21,009 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:21,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 125 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:36:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-26 00:36:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-11-26 00:36:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 74 states have internal predecessors, (89), 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-11-26 00:36:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-11-26 00:36:21,022 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 30 [2022-11-26 00:36:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:21,022 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-11-26 00:36:21,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 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-11-26 00:36:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-11-26 00:36:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:36:21,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:21,024 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-11-26 00:36:21,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-26 00:36:21,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-26 00:36:21,230 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:36:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash 214184440, now seen corresponding path program 1 times [2022-11-26 00:36:21,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:21,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336614689] [2022-11-26 00:36:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:36:21,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:21,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336614689] [2022-11-26 00:36:21,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336614689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:21,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352343332] [2022-11-26 00:36:21,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:21,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:21,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:36:21,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:36:21,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:36:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:21,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:36:21,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:36:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:36:21,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:36:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:36:21,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352343332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:36:21,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1083000491] [2022-11-26 00:36:21,676 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-26 00:36:21,677 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:36:21,677 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:36:21,677 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:36:21,678 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:36:21,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:36:21,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:36:21,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:21,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:36:21,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:21,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:36:21,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:21,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:36:21,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-11-26 00:36:21,831 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-11-26 00:36:21,842 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-11-26 00:36:21,851 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-11-26 00:36:21,859 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-11-26 00:36:21,894 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-11-26 00:36:21,903 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-11-26 00:36:21,913 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-11-26 00:36:21,922 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-11-26 00:36:21,930 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-11-26 00:36:22,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:22,005 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 189 treesize of output 173 [2022-11-26 00:36:22,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-26 00:36:22,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 98 [2022-11-26 00:36:22,110 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-11-26 00:36:22,118 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-11-26 00:36:22,127 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-11-26 00:36:22,136 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-11-26 00:36:22,145 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-11-26 00:36:22,186 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-11-26 00:36:22,196 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-11-26 00:36:22,207 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-11-26 00:36:22,217 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-11-26 00:36:22,228 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-11-26 00:36:22,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:22,296 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 189 treesize of output 173 [2022-11-26 00:36:22,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-26 00:36:22,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-11-26 00:36:22,402 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-11-26 00:36:22,410 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-11-26 00:36:22,419 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-11-26 00:36:22,429 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-11-26 00:36:22,439 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-11-26 00:36:22,474 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-11-26 00:36:22,483 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-11-26 00:36:22,495 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-11-26 00:36:22,504 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-11-26 00:36:22,514 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-11-26 00:36:22,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:22,553 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-26 00:36:22,564 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:22,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:22,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,647 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:36:22,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-11-26 00:36:22,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:22,665 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-26 00:36:22,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,692 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:36:22,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2022-11-26 00:36:22,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:22,814 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:36:22,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2022-11-26 00:36:22,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-26 00:36:22,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:22,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:22,860 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:36:22,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 28 [2022-11-26 00:36:23,294 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-26 00:36:23,294 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 1 case distinctions, treesize of input 360 treesize of output 357 [2022-11-26 00:36:23,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:23,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:23,397 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-26 00:36:23,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 332 [2022-11-26 00:36:23,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:23,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:23,473 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-26 00:36:23,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 336 [2022-11-26 00:36:23,891 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-26 00:36:23,891 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 1 case distinctions, treesize of input 160 treesize of output 154 [2022-11-26 00:36:23,926 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-26 00:36:23,927 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 1 case distinctions, treesize of input 156 treesize of output 150 [2022-11-26 00:36:24,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:36:24,667 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-11-26 00:36:24,807 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:36:30,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1083000491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:36:30,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:36:30,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [8, 8, 8] total 24 [2022-11-26 00:36:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778087792] [2022-11-26 00:36:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:36:30,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:36:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:30,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:36:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2022-11-26 00:36:30,479 INFO L87 Difference]: Start difference. First operand 78 states and 93 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-11-26 00:36:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:33,546 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2022-11-26 00:36:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 00:36:33,547 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-11-26 00:36:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:33,547 INFO L225 Difference]: With dead ends: 78 [2022-11-26 00:36:33,547 INFO L226 Difference]: Without dead ends: 76 [2022-11-26 00:36:33,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:36:33,549 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:33,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 126 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:36:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-26 00:36:33,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-11-26 00:36:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.25) internal successors, (80), 70 states have internal predecessors, (80), 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-11-26 00:36:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-11-26 00:36:33,565 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 30 [2022-11-26 00:36:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:33,565 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-11-26 00:36:33,566 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-11-26 00:36:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-11-26 00:36:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 00:36:33,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:33,566 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-11-26 00:36:33,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-26 00:36:33,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-26 00:36:33,771 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:36:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1900983667, now seen corresponding path program 1 times [2022-11-26 00:36:33,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:33,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653195953] [2022-11-26 00:36:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-26 00:36:33,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:33,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653195953] [2022-11-26 00:36:33,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653195953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:33,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964647205] [2022-11-26 00:36:33,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:33,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:33,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:36:33,982 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:36:34,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:36:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:34,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:36:34,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:36:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:36:34,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:36:34,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964647205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:36:34,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:36:34,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-11-26 00:36:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68375516] [2022-11-26 00:36:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:36:34,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:36:34,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:36:34,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:36:34,289 INFO L87 Difference]: Start difference. First operand 74 states and 84 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-11-26 00:36:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:34,400 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-11-26 00:36:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:36:34,401 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-11-26 00:36:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:34,402 INFO L225 Difference]: With dead ends: 76 [2022-11-26 00:36:34,402 INFO L226 Difference]: Without dead ends: 74 [2022-11-26 00:36:34,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:36:34,403 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:34,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 54 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:36:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-26 00:36:34,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2022-11-26 00:36:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.21875) internal successors, (78), 68 states have internal predecessors, (78), 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-11-26 00:36:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-11-26 00:36:34,426 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 40 [2022-11-26 00:36:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:34,426 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-11-26 00:36:34,426 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-11-26 00:36:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-11-26 00:36:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-26 00:36:34,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:34,429 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-11-26 00:36:34,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-26 00:36:34,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 00:36:34,636 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:36:34,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:34,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1199048575, now seen corresponding path program 1 times [2022-11-26 00:36:34,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:34,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218342818] [2022-11-26 00:36:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-26 00:36:34,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:34,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218342818] [2022-11-26 00:36:34,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218342818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:34,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504847667] [2022-11-26 00:36:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:34,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:34,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:36:34,828 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:36:34,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 00:36:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:35,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:36:35,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:36:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:36:35,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:36:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:36:35,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504847667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:36:35,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [194336966] [2022-11-26 00:36:35,234 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-26 00:36:35,234 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:36:35,234 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:36:35,235 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:36:35,235 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:36:35,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:36:35,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:36:35,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:35,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:36:35,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:35,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:36:35,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:35,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:36:35,377 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-11-26 00:36:35,385 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-11-26 00:36:35,392 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-11-26 00:36:35,401 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-11-26 00:36:35,413 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-11-26 00:36:35,447 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-11-26 00:36:35,455 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-11-26 00:36:35,466 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-11-26 00:36:35,475 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-11-26 00:36:35,484 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-11-26 00:36:35,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:35,523 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:35,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:35,534 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:36:35,602 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-11-26 00:36:35,611 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-11-26 00:36:35,619 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-11-26 00:36:35,630 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-11-26 00:36:35,641 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-11-26 00:36:35,675 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-11-26 00:36:35,686 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-11-26 00:36:35,696 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-11-26 00:36:35,706 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-11-26 00:36:35,714 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-11-26 00:36:35,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:35,748 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:36:35,757 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:35,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:35,834 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-11-26 00:36:35,843 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-11-26 00:36:35,857 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-11-26 00:36:35,870 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-11-26 00:36:35,879 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-11-26 00:36:35,911 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-11-26 00:36:35,922 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-11-26 00:36:35,935 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-11-26 00:36:35,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-11-26 00:36:35,953 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-11-26 00:36:36,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:36,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:36,041 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 189 treesize of output 173 [2022-11-26 00:36:36,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:36,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-26 00:36:36,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:36,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-11-26 00:36:36,137 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:36:36,138 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:36:36,161 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:36:36,161 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:36:36,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:36,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:36:36,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:36,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:36,413 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-26 00:36:36,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 414 treesize of output 396 [2022-11-26 00:36:36,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:36,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:36,478 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-26 00:36:36,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 414 treesize of output 392 [2022-11-26 00:36:36,509 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-11-26 00:36:36,509 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 1 case distinctions, treesize of input 408 treesize of output 396 [2022-11-26 00:36:36,886 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-11-26 00:36:36,899 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-11-26 00:36:36,907 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-11-26 00:36:37,314 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-11-26 00:36:37,323 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-11-26 00:36:37,331 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-11-26 00:36:37,372 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-26 00:36:37,489 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:36:43,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [194336966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:36:43,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:36:43,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [6, 5, 5] total 32 [2022-11-26 00:36:43,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95088107] [2022-11-26 00:36:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:36:43,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:36:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:36:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:36:43,644 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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-11-26 00:36:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:48,733 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-11-26 00:36:48,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:36:48,734 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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-11-26 00:36:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:48,735 INFO L225 Difference]: With dead ends: 90 [2022-11-26 00:36:48,735 INFO L226 Difference]: Without dead ends: 87 [2022-11-26 00:36:48,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 85 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=357, Invalid=1713, Unknown=0, NotChecked=0, Total=2070 [2022-11-26 00:36:48,736 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:48,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 97 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 00:36:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-26 00:36:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 54. [2022-11-26 00:36:48,754 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-11-26 00:36:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-11-26 00:36:48,755 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 41 [2022-11-26 00:36:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:48,755 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-11-26 00:36:48,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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-11-26 00:36:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-11-26 00:36:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-26 00:36:48,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:48,756 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-11-26 00:36:48,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 00:36:48,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:48,956 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:36:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:48,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1234448993, now seen corresponding path program 1 times [2022-11-26 00:36:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:48,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683546064] [2022-11-26 00:36:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-26 00:36:49,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:49,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683546064] [2022-11-26 00:36:49,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683546064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:36:49,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:36:49,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:36:49,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272138852] [2022-11-26 00:36:49,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:36:49,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:36:49,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:36:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:36:49,024 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-11-26 00:36:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:49,064 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-11-26 00:36:49,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:36:49,064 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-11-26 00:36:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:49,065 INFO L225 Difference]: With dead ends: 54 [2022-11-26 00:36:49,065 INFO L226 Difference]: Without dead ends: 53 [2022-11-26 00:36:49,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:36:49,067 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:49,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:36:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-26 00:36:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-26 00:36:49,094 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-11-26 00:36:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-26 00:36:49,095 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 43 [2022-11-26 00:36:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:49,095 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-26 00:36:49,095 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-11-26 00:36:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-26 00:36:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-26 00:36:49,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:49,096 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-11-26 00:36:49,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-26 00:36:49,097 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-11-26 00:36:49,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:49,097 INFO L85 PathProgramCache]: Analyzing trace with hash -386786760, now seen corresponding path program 1 times [2022-11-26 00:36:49,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:49,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127474930] [2022-11-26 00:36:49,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:49,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:36:49,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:49,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127474930] [2022-11-26 00:36:49,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127474930] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:49,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117026055] [2022-11-26 00:36:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:49,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:49,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:36:49,226 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:36:49,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 00:36:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:49,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:36:49,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:36:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:36:49,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:36:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:36:49,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117026055] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:36:49,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [153980325] [2022-11-26 00:36:49,566 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:36:49,567 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:36:49,567 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:36:49,567 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:36:49,567 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:36:49,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:36:49,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:36:49,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:49,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:36:49,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:49,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:36:49,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:49,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:36:49,710 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-11-26 00:36:49,718 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-11-26 00:36:49,729 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-11-26 00:36:49,737 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-11-26 00:36:49,745 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-11-26 00:36:49,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-11-26 00:36:49,784 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-11-26 00:36:49,796 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-11-26 00:36:49,804 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-11-26 00:36:49,813 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-11-26 00:36:49,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:49,841 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:36:49,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:49,865 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:49,931 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-11-26 00:36:49,939 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-11-26 00:36:49,952 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-11-26 00:36:49,962 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-11-26 00:36:49,971 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-11-26 00:36:50,007 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-11-26 00:36:50,016 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-11-26 00:36:50,025 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-11-26 00:36:50,035 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-11-26 00:36:50,047 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-11-26 00:36:50,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:50,075 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:36:50,084 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:50,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:36:50,148 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-11-26 00:36:50,157 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-11-26 00:36:50,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-11-26 00:36:50,188 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-11-26 00:36:50,197 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-11-26 00:36:50,228 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-11-26 00:36:50,236 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-11-26 00:36:50,249 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-11-26 00:36:50,259 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-11-26 00:36:50,268 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-11-26 00:36:50,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:50,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:36:50,332 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 189 treesize of output 173 [2022-11-26 00:36:50,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:50,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-26 00:36:50,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:50,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 98 [2022-11-26 00:36:50,428 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:36:50,429 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:36:50,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:36:50,465 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:36:50,466 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:36:50,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:50,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:50,772 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-26 00:36:50,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 397 [2022-11-26 00:36:50,809 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-11-26 00:36:50,810 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 1 case distinctions, treesize of input 409 treesize of output 397 [2022-11-26 00:36:50,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:50,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:50,878 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-26 00:36:50,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 407 treesize of output 385 [2022-11-26 00:36:51,298 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-11-26 00:36:51,307 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-11-26 00:36:51,316 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-11-26 00:36:51,746 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-11-26 00:36:51,754 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-11-26 00:36:51,765 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-11-26 00:36:51,798 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-11-26 00:36:51,930 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:36:58,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [153980325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:36:58,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:36:58,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 33 [2022-11-26 00:36:58,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743467939] [2022-11-26 00:36:58,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:36:58,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 00:36:58,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 00:36:58,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2022-11-26 00:36:58,907 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-11-26 00:37:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:37:04,494 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-11-26 00:37:04,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:37:04,499 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-11-26 00:37:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:37:04,502 INFO L225 Difference]: With dead ends: 64 [2022-11-26 00:37:04,502 INFO L226 Difference]: Without dead ends: 63 [2022-11-26 00:37:04,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 92 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=296, Invalid=1960, Unknown=0, NotChecked=0, Total=2256 [2022-11-26 00:37:04,505 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:37:04,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 51 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 00:37:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-26 00:37:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-11-26 00:37:04,524 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-11-26 00:37:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-11-26 00:37:04,525 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 44 [2022-11-26 00:37:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:37:04,525 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-11-26 00:37:04,526 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-11-26 00:37:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-11-26 00:37:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-26 00:37:04,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:37:04,527 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-11-26 00:37:04,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-26 00:37:04,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:04,728 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:37:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:37:04,728 INFO L85 PathProgramCache]: Analyzing trace with hash 633004255, now seen corresponding path program 1 times [2022-11-26 00:37:04,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:37:04,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304407013] [2022-11-26 00:37:04,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:37:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:37:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:37:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:37:04,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:37:04,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304407013] [2022-11-26 00:37:04,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304407013] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:37:04,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451504577] [2022-11-26 00:37:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:37:04,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:04,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:37:04,878 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:37:04,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 00:37:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:37:05,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:37:05,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:37:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:37:05,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:37:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:37:05,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451504577] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:37:05,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1608517483] [2022-11-26 00:37:05,216 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:37:05,216 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:37:05,217 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:37:05,217 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:37:05,217 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:37:05,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:37:05,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:37:05,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:05,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:37:05,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:05,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:37:05,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:05,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:37:05,351 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-11-26 00:37:05,359 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-11-26 00:37:05,366 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-11-26 00:37:05,375 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-11-26 00:37:05,385 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-11-26 00:37:05,440 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-11-26 00:37:05,449 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-11-26 00:37:05,457 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-11-26 00:37:05,466 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-11-26 00:37:05,476 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-11-26 00:37:05,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:05,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:05,535 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 189 treesize of output 173 [2022-11-26 00:37:05,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:05,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-26 00:37:05,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:05,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-11-26 00:37:05,773 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:05,775 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:05,777 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:05,788 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-11-26 00:37:05,797 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-11-26 00:37:05,806 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-11-26 00:37:05,817 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-11-26 00:37:05,827 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-11-26 00:37:05,980 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:05,982 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:05,984 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:05,986 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:05,996 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-11-26 00:37:06,005 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-11-26 00:37:06,015 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-11-26 00:37:06,026 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-11-26 00:37:06,035 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-11-26 00:37:06,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:37:06,079 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:37:06,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:06,093 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:37:06,278 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:06,280 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:06,282 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:06,291 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-11-26 00:37:06,298 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-11-26 00:37:06,307 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-11-26 00:37:06,317 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-11-26 00:37:06,325 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-11-26 00:37:06,468 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:06,470 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:06,471 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:37:06,481 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-11-26 00:37:06,489 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-11-26 00:37:06,498 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-11-26 00:37:06,507 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-11-26 00:37:06,515 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-11-26 00:37:06,558 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:37:06,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-26 00:37:06,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:06,580 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-26 00:37:06,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:06,784 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:37:06,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-11-26 00:37:06,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:37:06,801 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 25 treesize of output 13 [2022-11-26 00:37:06,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:06,829 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:37:06,829 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 1 case distinctions, treesize of input 26 treesize of output 21 [2022-11-26 00:37:07,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:07,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:07,104 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-26 00:37:07,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 423 treesize of output 405 [2022-11-26 00:37:07,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:07,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:07,172 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-26 00:37:07,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 423 treesize of output 401 [2022-11-26 00:37:07,203 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-26 00:37:07,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 1 case distinctions, treesize of input 417 treesize of output 401 [2022-11-26 00:37:07,589 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-11-26 00:37:07,597 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-11-26 00:37:07,610 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-11-26 00:37:08,360 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-11-26 00:37:08,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-26 00:37:08,381 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-11-26 00:37:08,424 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-26 00:37:08,541 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:37:14,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1608517483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:37:14,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:37:14,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [8, 8, 8] total 29 [2022-11-26 00:37:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254746258] [2022-11-26 00:37:14,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:37:14,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:37:14,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:37:14,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:37:14,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:37:14,683 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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-11-26 00:37:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:37:19,389 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-11-26 00:37:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:37:19,392 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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-11-26 00:37:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:37:19,393 INFO L225 Difference]: With dead ends: 55 [2022-11-26 00:37:19,393 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:37:19,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 99 SyntacticMatches, 21 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=194, Invalid=1612, Unknown=0, NotChecked=0, Total=1806 [2022-11-26 00:37:19,394 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:37:19,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 00:37:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:37:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:37:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:37:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:37:19,395 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-11-26 00:37:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:37:19,395 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:37:19,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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-11-26 00:37:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:37:19,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:37:19,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-26 00:37:19,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-26 00:37:19,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-26 00:37:19,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-26 00:37:19,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-26 00:37:19,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-26 00:37:19,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-26 00:37:19,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-26 00:37:19,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-26 00:37:19,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-26 00:37:19,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-26 00:37:19,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-26 00:37:19,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-26 00:37:19,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-26 00:37:19,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-26 00:37:19,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-26 00:37:19,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:37:25,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-11-26 00:37:25,435 INFO L902 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2022-11-26 00:37:25,435 INFO L899 garLoopResultBuilder]: For program point L630(line 630) no Hoare annotation was computed. [2022-11-26 00:37:25,435 INFO L899 garLoopResultBuilder]: For program point L630-1(line 630) no Hoare annotation was computed. [2022-11-26 00:37:25,435 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-11-26 00:37:25,436 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse1 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse3 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |#NULL.offset| 0)) (.cse7 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (.cse8 (<= 2 |ULTIMATE.start_main_~new_data~0#1|)) (.cse9 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse10 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse11 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (.cse12 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse13 (= |#NULL.base| 0))) (or (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 4) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 2) .cse0 .cse1 (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 4) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse2 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 4) .cse3 .cse4 (<= 2 |ULTIMATE.start_sll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse5 .cse6 .cse7 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 2) (<= 0 (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) .cse8 .cse9 .cse10 .cse11 (<= 0 |#StackHeapBarrier|) .cse12 .cse13) (let ((.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse0 (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) .cse3 .cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_update_at_~index#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|) (not (= 0 .cse14)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse5 (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) .cse6 (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_~index#1|) .cse10 .cse11 .cse12 (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse14) (< 0 |#StackHeapBarrier|) .cse13)))) [2022-11-26 00:37:25,436 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-11-26 00:37:25,436 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:37:25,436 INFO L895 garLoopResultBuilder]: At program point L631(lines 631 633) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_#t~ret17#1| 2147483647)) (.cse1 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse2 (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0)) (.cse3 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse5 (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 4)) (.cse6 (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|)) (.cse7 (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 2)) (.cse8 (<= 0 (+ |ULTIMATE.start_main_#t~ret17#1| 2147483648))) (.cse9 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse10 (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 4)) (.cse11 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse12 (<= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse13 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse14 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse15 (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (.cse16 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse17 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|)) (.cse18 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse19 (<= |ULTIMATE.start_main_~new_data~0#1| 4)) (.cse20 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse21 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse22 (<= 2 |ULTIMATE.start_sll_circular_update_at_#in~data#1|)) (.cse23 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse24 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_#t~ret17#1|)) (.cse27 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (.cse28 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (.cse29 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 2)) (.cse30 (<= 0 (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1))) (.cse31 (<= 2 |ULTIMATE.start_main_~expected~0#1|)) (.cse32 (<= 2 |ULTIMATE.start_main_~new_data~0#1|)) (.cse33 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse34 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse35 (<= 0 |#StackHeapBarrier|)) (.cse36 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse37 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) .cse2 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) .cse8 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse23 .cse24 .cse25 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) .cse37) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| 4) .cse2 .cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 .cse6 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) .cse13 .cse14 .cse15 .cse16 .cse17 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 2) .cse34 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|) .cse35 .cse36 .cse37))) [2022-11-26 00:37:25,436 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-11-26 00:37:25,436 INFO L899 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2022-11-26 00:37:25,437 INFO L899 garLoopResultBuilder]: For program point L590-1(line 590) no Hoare annotation was computed. [2022-11-26 00:37:25,437 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2022-11-26 00:37:25,437 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-11-26 00:37:25,437 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse0 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse1 (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse3 (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 4)) (.cse4 (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|)) (.cse5 (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 2)) (.cse6 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 4)) (.cse8 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse9 (<= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse10 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse11 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse12 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse13 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|)) (.cse14 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse15 (<= |ULTIMATE.start_main_~new_data~0#1| 4)) (.cse16 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse17 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse18 (<= 2 |ULTIMATE.start_sll_circular_update_at_#in~data#1|)) (.cse19 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse20 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse21 (= |#NULL.offset| 0)) (.cse22 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (.cse23 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (.cse24 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 2)) (.cse25 (<= 0 (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1))) (.cse26 (<= 2 |ULTIMATE.start_main_~expected~0#1|)) (.cse27 (<= 2 |ULTIMATE.start_main_~new_data~0#1|)) (.cse28 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse29 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse30 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|)) (.cse31 (<= 0 |#StackHeapBarrier|)) (.cse32 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse33 (= |#NULL.base| 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|) .cse2 .cse3 .cse4 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) .cse10 .cse11 .cse12 .cse13 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse14 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 2) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 2) .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse0 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) .cse1 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse19 .cse20 .cse21 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse22 .cse23 .cse24 .cse25 .cse26 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) .cse33))) [2022-11-26 00:37:25,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2022-11-26 00:37:25,438 INFO L899 garLoopResultBuilder]: For program point L616(line 616) no Hoare annotation was computed. [2022-11-26 00:37:25,438 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2022-11-26 00:37:25,438 INFO L899 garLoopResultBuilder]: For program point L625-3(line 625) no Hoare annotation was computed. [2022-11-26 00:37:25,438 INFO L899 garLoopResultBuilder]: For program point L625-4(line 625) no Hoare annotation was computed. [2022-11-26 00:37:25,439 INFO L895 garLoopResultBuilder]: At program point L625-5(lines 625 628) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse5 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse6 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse8 (= |#NULL.base| 0))) (or (let ((.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and .cse0 (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) .cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) .cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (not (= 0 .cse4)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (= |#NULL.offset| 0) .cse5 .cse6 .cse7 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse4) (< 0 |#StackHeapBarrier|) .cse8)) (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) .cse0 (<= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_~index#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 4) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 2) .cse1 (<= |ULTIMATE.start_main_~i~0#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 4) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse2 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 4) .cse3 (<= 2 |ULTIMATE.start_sll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |#NULL.offset|) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse5 (<= 1 |ULTIMATE.start_main_~data~0#1|) .cse6 (<= 0 |#StackHeapBarrier|) .cse7 .cse8))) [2022-11-26 00:37:25,439 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-26 00:37:25,439 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |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-11-26 00:37:25,440 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-11-26 00:37:25,440 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2022-11-26 00:37:25,440 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2022-11-26 00:37:25,440 INFO L899 garLoopResultBuilder]: For program point L626(line 626) no Hoare annotation was computed. [2022-11-26 00:37:25,440 INFO L899 garLoopResultBuilder]: For program point L626-1(line 626) no Hoare annotation was computed. [2022-11-26 00:37:25,440 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-26 00:37:25,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2022-11-26 00:37:25,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-11-26 00:37:25,441 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse3 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |#NULL.offset| 0)) (.cse7 (< 0 |#StackHeapBarrier|)) (.cse8 (= |#NULL.base| 0))) (or (and (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) .cse2 .cse3 .cse4 (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse5 (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) .cse6 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse7 .cse8) (let ((.cse9 (select |#memory_int| 1))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= 2 (select |#length| 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) .cse0 .cse1 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) .cse2 .cse3 .cse4 (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| 0) 0) .cse5 (= (select |#valid| 2) 1) .cse6 (= (select .cse9 0) 48) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select .cse9 1) 0) .cse7 .cse8)))) [2022-11-26 00:37:25,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:37:25,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2022-11-26 00:37:25,442 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-11-26 00:37:25,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-11-26 00:37:25,442 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= 2 (select |#length| 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 00:37:25,443 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-11-26 00:37:25,443 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-11-26 00:37:25,443 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-11-26 00:37:25,443 INFO L899 garLoopResultBuilder]: For program point L629-3(line 629) no Hoare annotation was computed. [2022-11-26 00:37:25,443 INFO L899 garLoopResultBuilder]: For program point L629-4(line 629) no Hoare annotation was computed. [2022-11-26 00:37:25,443 INFO L895 garLoopResultBuilder]: At program point L629-5(lines 629 634) the Hoare annotation is: (let ((.cse0 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 4)) (.cse5 (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|)) (.cse6 (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 2)) (.cse7 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 4)) (.cse10 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse11 (<= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse12 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse13 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse14 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse15 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|)) (.cse16 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse17 (<= |ULTIMATE.start_main_~new_data~0#1| 4)) (.cse18 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse19 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse20 (<= 2 |ULTIMATE.start_sll_circular_update_at_#in~data#1|)) (.cse21 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse22 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse23 (= |#NULL.offset| 0)) (.cse24 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (.cse25 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 2)) (.cse26 (<= 0 (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1))) (.cse27 (<= 2 |ULTIMATE.start_main_~new_data~0#1|)) (.cse28 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse29 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse30 (<= 0 |#StackHeapBarrier|)) (.cse31 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse32 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_main_~expected~0#1| 4) .cse2 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_main_~i~0#1| 2) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) .cse12 .cse13 .cse14 .cse15 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse16 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 2) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) .cse24 .cse25 .cse26 (<= 2 |ULTIMATE.start_main_~expected~0#1|) .cse27 .cse28 (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 2) .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32))) [2022-11-26 00:37:25,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-11-26 00:37:25,444 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-11-26 00:37:25,444 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-26 00:37:25,445 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (let ((.cse0 (not (< 0 |#StackHeapBarrier|)))) (and (let ((.cse1 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 (not (= |node_create_#in~data#1| 1)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse1 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse1 1) 0)) (not (= 19 (select |old(#length)| 2))))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32| Int)) (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32|) 4))) (or (not (= 8 (select |old(#length)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32|))) (not (= .cse2 |node_create_#in~data#1|)) (= |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32| 0) (not (= .cse2 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32|) 0) 0)) (not (< |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32| |#StackHeapBarrier|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32|) 0) 0)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32|) 1))))) .cse0))) (not (<= |#NULL.base| 0)) (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-11-26 00:37:25,445 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-11-26 00:37:25,449 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:37:25,451 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:37:25,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,475 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,475 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,479 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,480 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,480 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,480 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,481 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,489 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,490 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,490 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,490 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,494 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,496 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:37:25 BoogieIcfgContainer [2022-11-26 00:37:25,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:37:25,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:37:25,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:37:25,508 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:37:25,508 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:35:51" (3/4) ... [2022-11-26 00:37:25,512 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:37:25,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-26 00:37:25,524 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-26 00:37:25,524 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-26 00:37:25,524 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 00:37:25,525 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:37:25,553 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && #memory_$Pointer$[new_head][new_head] == last) && unknown-#memory_int-unknown[new_head][4] == data) && last == 0) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && !(last == 0)) && len + 1 == \old(len)) && 1 <= \old(data)) && \old(data) == data) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && data <= 1) && 8 == unknown-#length-unknown[new_head]) && head == new_head) && len == 2) && !(new_head == 0)) && #NULL == 0) && new_head == 0) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((#memory_$Pointer$[head][0] == 0 && unknown-#length-unknown[head] == 8) && head == 0) && 2 == unknown-#length-unknown[1]) && \valid[head] == 1) && head == last) && \old(len) == len) && unknown-#memory_int-unknown[head][4] == data) && 1 <= \old(data)) && \old(data) == data) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && len == \old(len)) && data == 1) && data <= 1) && head < unknown-#StackHeapBarrier-unknown) && head == last) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-26 00:37:25,554 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((0 <= s && new_head < unknown-#StackHeapBarrier-unknown) && i == 0) && last == 0) && \result <= 0) && head == #memory_$Pointer$[last][last]) && head == new_head) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && len + 1 == \old(len)) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && \old(data) == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && head == \result) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && !(0 == #memory_$Pointer$[new_head][new_head])) && head == new_head) && len == 2) && \result == s) && !(new_head == 0)) && #NULL == 0) && 0 <= \result) && new_head == 0) && s <= 0) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && data <= 1) && head <= 0) && 2 <= len) && 0 <= index) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && last <= 0) && \old(index) <= 2) && \result <= 0) && i <= 2) && data <= 4) && \old(len) <= 2) && #NULL <= 0) && len <= 2) && 2 <= data) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && index <= 0) && len <= 1) && new_data <= 4) && data <= 1) && 2 <= \old(data)) && head <= 0) && 0 <= head) && 0 <= #NULL) && 2 <= new_data) && 0 <= \result) && 1 <= data) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) [2022-11-26 00:37:25,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && expected <= 4) && head <= 0) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && \result <= 0) && i <= 2) && data <= 4) && \old(len) <= 2) && 2 <= data) && head <= 0) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= \old(index)) && len <= 1) && index <= 2) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= expected) && 2 <= new_data) && 0 <= \result) && \old(index) <= 2) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && head <= 0) && i == 0) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= new_data) && 0 <= \result) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) [2022-11-26 00:37:25,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && head <= 0) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= new_data) && 0 <= \result) && new_head == 0) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && head == s) && last == 0) && head == head) && head == head) && \result <= 0) && head == new_head) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && len + 1 == \old(len)) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && \old(data) == data) && s == head) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && index == \old(index)) && len + i == new_data) && !(0 == #memory_$Pointer$[new_head][new_head])) && head == new_head) && len == 2) && !(new_head == 0)) && #NULL == 0) && \old(data) == data) && 0 <= head) && 2 <= new_data) && 0 <= \result) && i == index) && new_head == 0) && i < len) && s <= 0) && \old(data) == new_data) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-26 00:37:25,556 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && expected <= 4) && head <= 0) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && last <= 0) && \old(index) <= 2) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 0 <= last) && head <= 0) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= \old(index)) && len <= 1) && index <= 2) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= expected) && 2 <= new_data) && 0 <= \result) && \old(index) <= 2) && new_head == 0) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((2 <= \old(len) && s == head) && head <= 0) && s == head) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && len + i == expected) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && index == \old(index)) && head <= 0) && len == 2) && #NULL == 0) && i == \old(index)) && 0 <= head) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= expected) && head == head) && 2 <= new_data) && 0 <= \result) && new_head == 0) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && head == head) && #NULL == 0) [2022-11-26 00:37:25,556 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((aux-sll_circular_get_data_at(s, i)-aux <= 2147483647 && 2 <= \old(len)) && s == head) && head <= 0) && s == head) && index <= 0) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && 0 <= aux-sll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 1 <= data) && 0 <= head) && \result == unknown-#memory_int-unknown[head][head + 4]) && 1 <= \old(data)) && 0 <= \old(index)) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && index == \old(index)) && head <= 0) && len == 2) && #NULL == 0) && i == \old(index)) && \result == aux-sll_circular_get_data_at(s, i)-aux) && 0 <= head) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= expected) && head == head) && 2 <= new_data) && 0 <= \result) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && head == head) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((((((aux-sll_circular_get_data_at(s, i)-aux <= 2147483647 && 2 <= \old(len)) && 0 <= s) && expected <= 4) && head <= 0) && index <= 0) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && last <= 0) && \old(index) <= 2) && 0 <= aux-sll_circular_get_data_at(s, i)-aux + 2147483648) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 0 <= last) && head <= 0) && 1 <= data) && 0 <= head) && \result == unknown-#memory_int-unknown[head][head + 4]) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= \old(index)) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && \result == aux-sll_circular_get_data_at(s, i)-aux) && 0 <= head) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= expected) && 2 <= new_data) && 0 <= \result) && \old(index) <= 2) && new_head == 0) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) [2022-11-26 00:37:25,571 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:37:25,571 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:37:25,571 INFO L158 Benchmark]: Toolchain (without parser) took 95410.24ms. Allocated memory was 146.8MB in the beginning and 398.5MB in the end (delta: 251.7MB). Free memory was 102.4MB in the beginning and 156.4MB in the end (delta: -54.0MB). Peak memory consumption was 198.2MB. Max. memory is 16.1GB. [2022-11-26 00:37:25,572 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 146.8MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:37:25,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.21ms. Allocated memory is still 146.8MB. Free memory was 102.1MB in the beginning and 84.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-26 00:37:25,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.61ms. Allocated memory is still 146.8MB. Free memory was 84.7MB in the beginning and 82.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:37:25,573 INFO L158 Benchmark]: Boogie Preprocessor took 74.77ms. Allocated memory is still 146.8MB. Free memory was 82.4MB in the beginning and 80.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:37:25,573 INFO L158 Benchmark]: RCFGBuilder took 656.96ms. Allocated memory is still 146.8MB. Free memory was 80.8MB in the beginning and 60.7MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-26 00:37:25,573 INFO L158 Benchmark]: TraceAbstraction took 94005.62ms. Allocated memory was 146.8MB in the beginning and 398.5MB in the end (delta: 251.7MB). Free memory was 60.1MB in the beginning and 160.6MB in the end (delta: -100.5MB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. [2022-11-26 00:37:25,573 INFO L158 Benchmark]: Witness Printer took 63.81ms. Allocated memory is still 398.5MB. Free memory was 160.6MB in the beginning and 156.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:37:25,575 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.29ms. Allocated memory is still 146.8MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.21ms. Allocated memory is still 146.8MB. Free memory was 102.1MB in the beginning and 84.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.61ms. Allocated memory is still 146.8MB. Free memory was 84.7MB in the beginning and 82.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.77ms. Allocated memory is still 146.8MB. Free memory was 82.4MB in the beginning and 80.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 656.96ms. Allocated memory is still 146.8MB. Free memory was 80.8MB in the beginning and 60.7MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 94005.62ms. Allocated memory was 146.8MB in the beginning and 398.5MB in the end (delta: 251.7MB). Free memory was 60.1MB in the beginning and 160.6MB in the end (delta: -100.5MB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. * Witness Printer took 63.81ms. Allocated memory is still 398.5MB. Free memory was 160.6MB in the beginning and 156.4MB 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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - 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$.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: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: 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: 93.8s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 595 mSDsluCounter, 1878 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1296 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3265 IncrementalHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 582 mSDtfsCounter, 3265 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 988 GetRequests, 609 SyntacticMatches, 75 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3105 ImplicationChecksByTransitivity, 52.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=16, InterpolantAutomatonStates: 196, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 169 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 35 NumberOfFragments, 1835 HoareAnnotationTreeSize, 16 FomulaSimplifications, 4140 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 4294 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 918 NumberOfCodeBlocks, 918 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1121 ConstructedInterpolants, 0 QuantifiedInterpolants, 2591 SizeOfPredicates, 25 NumberOfNonLiveVariables, 3168 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 40 InterpolantComputations, 15 PerfectInterpolantSequences, 330/433 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: 15.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 154, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 393, TOOLS_POST_TIME: 9.1s, TOOLS_POST_CALL_APPLICATIONS: 60, TOOLS_POST_CALL_TIME: 2.0s, TOOLS_POST_RETURN_APPLICATIONS: 48, TOOLS_POST_RETURN_TIME: 2.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 501, TOOLS_QUANTIFIERELIM_TIME: 13.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 756, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 66, DOMAIN_JOIN_TIME: 0.8s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 20, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 52, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 154, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 32, LOOP_SUMMARIZER_CACHE_MISSES: 32, LOOP_SUMMARIZER_OVERALL_TIME: 9.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 9.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 52, CALL_SUMMARIZER_APPLICATIONS: 48, CALL_SUMMARIZER_CACHE_MISSES: 6, CALL_SUMMARIZER_OVERALL_TIME: 0.3s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.3s, 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: 2223, DAG_COMPRESSION_RETAINED_NODES: 527, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && expected <= 4) && head <= 0) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && \result <= 0) && i <= 2) && data <= 4) && \old(len) <= 2) && 2 <= data) && head <= 0) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= \old(index)) && len <= 1) && index <= 2) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= expected) && 2 <= new_data) && 0 <= \result) && \old(index) <= 2) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && head <= 0) && i == 0) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= new_data) && 0 <= \result) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 625]: Loop Invariant [2022-11-26 00:37:25,589 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,590 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,590 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,590 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,591 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,592 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,592 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,593 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,593 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,593 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((0 <= s && new_head < unknown-#StackHeapBarrier-unknown) && i == 0) && last == 0) && \result <= 0) && head == #memory_$Pointer$[last][last]) && head == new_head) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && len + 1 == \old(len)) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && \old(data) == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && head == \result) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && !(0 == #memory_$Pointer$[new_head][new_head])) && head == new_head) && len == 2) && \result == s) && !(new_head == 0)) && #NULL == 0) && 0 <= \result) && new_head == 0) && s <= 0) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && data <= 1) && head <= 0) && 2 <= len) && 0 <= index) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && last <= 0) && \old(index) <= 2) && \result <= 0) && i <= 2) && data <= 4) && \old(len) <= 2) && #NULL <= 0) && len <= 2) && 2 <= data) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && index <= 0) && len <= 1) && new_data <= 4) && data <= 1) && 2 <= \old(data)) && head <= 0) && 0 <= head) && 0 <= #NULL) && 2 <= new_data) && 0 <= \result) && 1 <= data) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((aux-sll_circular_get_data_at(s, i)-aux <= 2147483647 && 2 <= \old(len)) && s == head) && head <= 0) && s == head) && index <= 0) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && 0 <= aux-sll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 1 <= data) && 0 <= head) && \result == unknown-#memory_int-unknown[head][head + 4]) && 1 <= \old(data)) && 0 <= \old(index)) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && index == \old(index)) && head <= 0) && len == 2) && #NULL == 0) && i == \old(index)) && \result == aux-sll_circular_get_data_at(s, i)-aux) && 0 <= head) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= expected) && head == head) && 2 <= new_data) && 0 <= \result) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && head == head) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((((((aux-sll_circular_get_data_at(s, i)-aux <= 2147483647 && 2 <= \old(len)) && 0 <= s) && expected <= 4) && head <= 0) && index <= 0) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && last <= 0) && \old(index) <= 2) && 0 <= aux-sll_circular_get_data_at(s, i)-aux + 2147483648) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 0 <= last) && head <= 0) && 1 <= data) && 0 <= head) && \result == unknown-#memory_int-unknown[head][head + 4]) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= \old(index)) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && \result == aux-sll_circular_get_data_at(s, i)-aux) && 0 <= head) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= expected) && 2 <= new_data) && 0 <= \result) && \old(index) <= 2) && new_head == 0) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2022-11-26 00:37:25,598 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,599 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,599 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,600 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,601 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,601 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,601 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,602 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && #memory_$Pointer$[new_head][new_head] == last) && unknown-#memory_int-unknown[new_head][4] == data) && last == 0) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && !(last == 0)) && len + 1 == \old(len)) && 1 <= \old(data)) && \old(data) == data) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && data <= 1) && 8 == unknown-#length-unknown[new_head]) && head == new_head) && len == 2) && !(new_head == 0)) && #NULL == 0) && new_head == 0) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((#memory_$Pointer$[head][0] == 0 && unknown-#length-unknown[head] == 8) && head == 0) && 2 == unknown-#length-unknown[1]) && \valid[head] == 1) && head == last) && \old(len) == len) && unknown-#memory_int-unknown[head][4] == data) && 1 <= \old(data)) && \old(data) == data) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && len == \old(len)) && data == 1) && data <= 1) && head < unknown-#StackHeapBarrier-unknown) && head == last) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 614]: Loop Invariant [2022-11-26 00:37:25,603 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,604 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,604 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,606 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 00:37:25,606 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 00:37:25,606 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && head <= 0) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= new_data) && 0 <= \result) && new_head == 0) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && head == s) && last == 0) && head == head) && head == head) && \result <= 0) && head == new_head) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && len + 1 == \old(len)) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && \old(data) == data) && s == head) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && index == \old(index)) && len + i == new_data) && !(0 == #memory_$Pointer$[new_head][new_head])) && head == new_head) && len == 2) && !(new_head == 0)) && #NULL == 0) && \old(data) == data) && 0 <= head) && 2 <= new_data) && 0 <= \result) && i == index) && new_head == 0) && i < len) && s <= 0) && \old(data) == new_data) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && expected <= 4) && head <= 0) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && last <= 0) && \old(index) <= 2) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 0 <= last) && head <= 0) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= \old(index)) && len <= 1) && index <= 2) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= expected) && 2 <= new_data) && 0 <= \result) && \old(index) <= 2) && new_head == 0) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((2 <= \old(len) && s == head) && head <= 0) && s == head) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && len + i == expected) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && index == \old(index)) && head <= 0) && len == 2) && #NULL == 0) && i == \old(index)) && 0 <= head) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= expected) && head == head) && 2 <= new_data) && 0 <= \result) && new_head == 0) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && head == head) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-26 00:37:25,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a062a19-1126-498c-9dd8-d403536bc00e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE