./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 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_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 00:15:46,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:15:46,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:15:46,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:15:46,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:15:46,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:15:46,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:15:46,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:15:46,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:15:46,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:15:46,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:15:46,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:15:46,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:15:46,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:15:46,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:15:46,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:15:46,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:15:46,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:15:46,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:15:46,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:15:46,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:15:46,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:15:46,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:15:46,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:15:46,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:15:46,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:15:46,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:15:46,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:15:46,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:15:46,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:15:46,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:15:46,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:15:46,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:15:46,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:15:46,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:15:46,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:15:46,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:15:46,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:15:46,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:15:46,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:15:46,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:15:46,273 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 00:15:46,316 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:15:46,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:15:46,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:15:46,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:15:46,317 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:15:46,318 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:15:46,318 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:15:46,318 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:15:46,318 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:15:46,319 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:15:46,319 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:15:46,319 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:15:46,319 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:15:46,320 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:15:46,320 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:15:46,320 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:15:46,321 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:15:46,321 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:15:46,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:15:46,322 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:15:46,322 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:15:46,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:15:46,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:15:46,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:15:46,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:15:46,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:15:46,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:15:46,324 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 00:15:46,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:15:46,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:15:46,324 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:15:46,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:15:46,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:15:46,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:15:46,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:15:46,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:15:46,326 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:15:46,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:15:46,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:15:46,327 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:15:46,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:15:46,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:15:46,327 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:15:46,328 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_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/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_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2022-11-22 00:15:46,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:15:46,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:15:46,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:15:46,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:15:46,663 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:15:46,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-11-22 00:15:49,822 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:15:50,054 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:15:50,054 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/sv-benchmarks/c/list-simple/dll2c_update_all.i [2022-11-22 00:15:50,067 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/data/79bdd9d6d/f5e5da6339c040be8c3e53d1ca4713f4/FLAG2423b348c [2022-11-22 00:15:50,083 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/data/79bdd9d6d/f5e5da6339c040be8c3e53d1ca4713f4 [2022-11-22 00:15:50,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:15:50,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:15:50,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:15:50,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:15:50,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:15:50,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1241d8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50, skipping insertion in model container [2022-11-22 00:15:50,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:15:50,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:15:50,420 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_4c06e3e8-0728-4d70-ace0-38d703416329/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2022-11-22 00:15:50,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:15:50,442 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:15:50,516 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_4c06e3e8-0728-4d70-ace0-38d703416329/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2022-11-22 00:15:50,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:15:50,550 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:15:50,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50 WrapperNode [2022-11-22 00:15:50,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:15:50,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:15:50,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:15:50,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:15:50,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,632 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2022-11-22 00:15:50,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:15:50,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:15:50,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:15:50,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:15:50,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,676 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:15:50,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:15:50,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:15:50,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:15:50,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (1/1) ... [2022-11-22 00:15:50,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:15:50,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:15:50,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:15:50,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:15:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:15:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:15:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-22 00:15:50,768 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-22 00:15:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 00:15:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:15:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 00:15:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 00:15:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:15:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:15:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:15:50,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:15:50,990 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:15:50,992 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:15:51,360 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:15:51,443 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:15:51,443 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-22 00:15:51,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:51 BoogieIcfgContainer [2022-11-22 00:15:51,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:15:51,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:15:51,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:15:51,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:15:51,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:15:50" (1/3) ... [2022-11-22 00:15:51,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db9553f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:15:51, skipping insertion in model container [2022-11-22 00:15:51,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:50" (2/3) ... [2022-11-22 00:15:51,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db9553f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:15:51, skipping insertion in model container [2022-11-22 00:15:51,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:51" (3/3) ... [2022-11-22 00:15:51,458 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2022-11-22 00:15:51,481 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:15:51,481 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-22 00:15:51,538 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:15:51,546 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;@68daf9d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:15:51,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-22 00:15:51,556 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-22 00:15:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 00:15:51,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:51,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:51,567 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-22 00:15:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash 429436738, now seen corresponding path program 1 times [2022-11-22 00:15:51,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:51,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393747022] [2022-11-22 00:15:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:52,025 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-22 00:15:52,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:52,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393747022] [2022-11-22 00:15:52,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393747022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:52,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:52,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286995582] [2022-11-22 00:15:52,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:52,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:52,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:52,078 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-22 00:15:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:52,175 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-11-22 00:15:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:52,178 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-22 00:15:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:52,187 INFO L225 Difference]: With dead ends: 89 [2022-11-22 00:15:52,188 INFO L226 Difference]: Without dead ends: 49 [2022-11-22 00:15:52,191 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-22 00:15:52,200 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:52,203 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.1s Time] [2022-11-22 00:15:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-22 00:15:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-11-22 00:15: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-22 00:15:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-11-22 00:15:52,262 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2022-11-22 00:15:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:52,262 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-11-22 00:15: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-22 00:15:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-11-22 00:15:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:15:52,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:52,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:52,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:15:52,267 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-22 00:15:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash 380814026, now seen corresponding path program 1 times [2022-11-22 00:15:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:52,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782342500] [2022-11-22 00:15:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:52,550 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-22 00:15:52,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782342500] [2022-11-22 00:15:52,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782342500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:52,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:52,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:52,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586527651] [2022-11-22 00:15:52,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:52,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:52,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:52,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:52,556 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-22 00:15:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:52,669 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-11-22 00:15:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:52,672 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-22 00:15:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:52,677 INFO L225 Difference]: With dead ends: 49 [2022-11-22 00:15:52,677 INFO L226 Difference]: Without dead ends: 48 [2022-11-22 00:15:52,679 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-22 00:15:52,682 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-22 00:15:52,685 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-22 00:15:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-22 00:15:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-11-22 00:15:52,696 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-22 00:15:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-11-22 00:15:52,705 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 13 [2022-11-22 00:15:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:52,706 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-11-22 00:15:52,707 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-22 00:15:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-11-22 00:15:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:15:52,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:52,709 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:52,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:15:52,710 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-22 00:15:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1079667026, now seen corresponding path program 1 times [2022-11-22 00:15:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:52,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002845587] [2022-11-22 00:15:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:52,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:52,882 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-22 00:15:52,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:52,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002845587] [2022-11-22 00:15:52,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002845587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:52,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:52,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:52,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536100444] [2022-11-22 00:15:52,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:52,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:52,886 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-22 00:15:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:52,959 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-22 00:15:52,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:52,960 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-22 00:15:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:52,961 INFO L225 Difference]: With dead ends: 48 [2022-11-22 00:15:52,962 INFO L226 Difference]: Without dead ends: 47 [2022-11-22 00:15:52,962 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-22 00:15:52,964 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:52,964 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.1s Time] [2022-11-22 00:15:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-22 00:15:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-22 00:15:52,970 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-22 00:15:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-22 00:15:52,972 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 14 [2022-11-22 00:15:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:52,972 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-22 00:15:52,973 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-22 00:15:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-22 00:15:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:15:52,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:52,974 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:52,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:15:52,975 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-22 00:15:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash 649914152, now seen corresponding path program 1 times [2022-11-22 00:15:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:52,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665288439] [2022-11-22 00:15:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:53,186 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-22 00:15:53,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:53,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665288439] [2022-11-22 00:15:53,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665288439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:15:53,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977149588] [2022-11-22 00:15:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:53,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:15:53,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:15:53,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:15:53,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:15:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:53,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:15:53,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:53,446 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-22 00:15:53,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:53,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977149588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:53,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:15:53,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-22 00:15:53,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995211515] [2022-11-22 00:15:53,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:53,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:53,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:53,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:53,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:15:53,450 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-22 00:15:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:53,543 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-11-22 00:15:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:15:53,544 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-22 00:15:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:53,546 INFO L225 Difference]: With dead ends: 76 [2022-11-22 00:15:53,546 INFO L226 Difference]: Without dead ends: 74 [2022-11-22 00:15:53,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-22 00:15:53,552 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 91 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:53,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 54 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-22 00:15:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2022-11-22 00:15:53,560 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-22 00:15:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-11-22 00:15:53,561 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2022-11-22 00:15:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:53,562 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-11-22 00:15:53,562 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-22 00:15:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-11-22 00:15:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 00:15:53,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:53,567 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:53,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:53,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:15:53,775 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-22 00:15:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1327497694, now seen corresponding path program 1 times [2022-11-22 00:15:53,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:53,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758437383] [2022-11-22 00:15:53,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:53,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:53,923 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-22 00:15:53,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:53,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758437383] [2022-11-22 00:15:53,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758437383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:53,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:53,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929761980] [2022-11-22 00:15:53,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:53,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:53,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:53,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:53,930 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-22 00:15:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:53,999 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-11-22 00:15:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:15:54,000 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-22 00:15:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:54,002 INFO L225 Difference]: With dead ends: 74 [2022-11-22 00:15:54,002 INFO L226 Difference]: Without dead ends: 72 [2022-11-22 00:15:54,003 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-22 00:15:54,004 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:54,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 60 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-22 00:15:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-11-22 00:15:54,026 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-22 00:15:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-11-22 00:15:54,029 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2022-11-22 00:15:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:54,030 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-11-22 00:15:54,032 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-22 00:15:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-11-22 00:15:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:15:54,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:54,033 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-22 00:15:54,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:15:54,034 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:15:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash -119994364, now seen corresponding path program 1 times [2022-11-22 00:15:54,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:54,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117143226] [2022-11-22 00:15:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:54,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:54,198 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-22 00:15:54,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:54,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117143226] [2022-11-22 00:15:54,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117143226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:54,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:54,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:54,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589269878] [2022-11-22 00:15:54,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:54,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:54,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:54,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:54,202 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:15:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:54,350 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2022-11-22 00:15:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:54,351 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-22 00:15:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:54,353 INFO L225 Difference]: With dead ends: 133 [2022-11-22 00:15:54,353 INFO L226 Difference]: Without dead ends: 101 [2022-11-22 00:15:54,354 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-22 00:15:54,359 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 58 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:54,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-22 00:15:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 54. [2022-11-22 00:15:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 49 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:15:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-11-22 00:15:54,388 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 20 [2022-11-22 00:15:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:54,388 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-11-22 00:15:54,389 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-22 00:15:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-11-22 00:15:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:15:54,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:54,391 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-22 00:15:54,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:15:54,391 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:15:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:54,393 INFO L85 PathProgramCache]: Analyzing trace with hash -119990694, now seen corresponding path program 1 times [2022-11-22 00:15:54,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:54,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116505749] [2022-11-22 00:15:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:54,523 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-22 00:15:54,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:54,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116505749] [2022-11-22 00:15:54,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116505749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:54,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:54,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423380267] [2022-11-22 00:15:54,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:54,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:54,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:54,526 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:15:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:54,636 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-11-22 00:15:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:15:54,637 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-22 00:15:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:54,638 INFO L225 Difference]: With dead ends: 68 [2022-11-22 00:15:54,638 INFO L226 Difference]: Without dead ends: 66 [2022-11-22 00:15:54,638 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-22 00:15:54,639 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:54,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 87 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-22 00:15:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-11-22 00:15:54,650 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-22 00:15:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-11-22 00:15:54,652 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 20 [2022-11-22 00:15:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:54,652 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-11-22 00:15:54,652 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-22 00:15:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-11-22 00:15:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:15:54,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:54,654 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:54,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:15:54,654 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-22 00:15:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 93099952, now seen corresponding path program 1 times [2022-11-22 00:15:54,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:54,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467183783] [2022-11-22 00:15:54,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:54,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-22 00:15:54,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:54,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467183783] [2022-11-22 00:15:54,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467183783] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:15:54,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190404682] [2022-11-22 00:15:54,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:54,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:15:54,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:15:54,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:15:54,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:15:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:54,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:15:54,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:15:55,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:55,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190404682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:55,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:15:55,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-22 00:15:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987226590] [2022-11-22 00:15:55,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:55,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:15:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:55,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:15:55,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:15:55,025 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-22 00:15:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:55,079 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2022-11-22 00:15:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:55,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 21 [2022-11-22 00:15:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:55,081 INFO L225 Difference]: With dead ends: 98 [2022-11-22 00:15:55,081 INFO L226 Difference]: Without dead ends: 50 [2022-11-22 00:15:55,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-22 00:15:55,082 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 75 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-22 00:15:55,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 75 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:15:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-22 00:15:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-22 00:15:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-11-22 00:15:55,089 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 21 [2022-11-22 00:15:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:55,089 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-11-22 00:15:55,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-22 00:15:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-11-22 00:15:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:15:55,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:55,090 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-22 00:15:55,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:55,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-22 00:15:55,297 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-22 00:15:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash 268208809, now seen corresponding path program 1 times [2022-11-22 00:15:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:55,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849988201] [2022-11-22 00:15:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:55,384 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-22 00:15:55,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:55,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849988201] [2022-11-22 00:15:55,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849988201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:55,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:55,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922019942] [2022-11-22 00:15:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:55,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:55,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:55,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:55,387 INFO L87 Difference]: Start difference. First operand 50 states and 55 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-22 00:15:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:55,484 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-22 00:15:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:55,485 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-22 00:15:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:55,486 INFO L225 Difference]: With dead ends: 76 [2022-11-22 00:15:55,486 INFO L226 Difference]: Without dead ends: 61 [2022-11-22 00:15:55,487 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-22 00:15:55,488 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 21 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:55,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 88 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-22 00:15:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2022-11-22 00:15:55,495 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-22 00:15:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-22 00:15:55,496 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 21 [2022-11-22 00:15:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:55,497 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-22 00:15:55,497 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-22 00:15:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-22 00:15:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:15:55,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:55,500 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-22 00:15:55,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:15:55,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:15:55,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:55,501 INFO L85 PathProgramCache]: Analyzing trace with hash -275372834, now seen corresponding path program 1 times [2022-11-22 00:15:55,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:55,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034926899] [2022-11-22 00:15:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:55,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:55,616 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-22 00:15:55,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:55,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034926899] [2022-11-22 00:15:55,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034926899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:55,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:55,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053741904] [2022-11-22 00:15:55,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:55,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:55,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:55,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:55,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:55,619 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-22 00:15:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:55,707 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-11-22 00:15:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:15:55,707 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-22 00:15:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:55,708 INFO L225 Difference]: With dead ends: 56 [2022-11-22 00:15:55,708 INFO L226 Difference]: Without dead ends: 54 [2022-11-22 00:15:55,708 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-22 00:15:55,709 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:55,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-22 00:15:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-22 00:15:55,718 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-22 00:15:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-11-22 00:15:55,719 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 22 [2022-11-22 00:15:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:55,719 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-11-22 00:15:55,719 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-22 00:15:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-11-22 00:15:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:15:55,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:55,724 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-22 00:15:55,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:15:55,724 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:15:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1229877301, now seen corresponding path program 1 times [2022-11-22 00:15:55,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:55,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206215635] [2022-11-22 00:15:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:15:55,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:55,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206215635] [2022-11-22 00:15:55,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206215635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:15:55,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238370988] [2022-11-22 00:15:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:55,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:15:55,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:15:55,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:15:55,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:15:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:56,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:15:56,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:56,361 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-22 00:15:56,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:15:56,466 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-22 00:15:56,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238370988] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:15:56,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1521982895] [2022-11-22 00:15:56,492 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-22 00:15:56,493 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:15:56,497 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:15:56,514 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:15:56,515 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:15:56,637 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-22 00:15:56,645 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-22 00:15:56,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:56,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:56,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 00:15:56,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:56,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:56,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:15:56,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:56,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:56,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:15:57,269 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-22 00:15:57,280 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-22 00:15:57,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:15:57,303 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-22 00:15:57,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:15:57,330 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:57,332 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:57,335 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:57,337 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:57,579 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-22 00:15:57,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:15:57,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:15:57,615 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-22 00:15:57,625 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-22 00:15:57,637 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:57,639 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:57,642 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:57,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:15:57,711 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 00:15:57,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2022-11-22 00:15:57,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-22 00:15:57,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:15:57,774 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 00:15:57,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2022-11-22 00:15:57,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:15:57,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-22 00:15:57,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:15:57,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:15:57,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:15:57,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:57,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:15:57,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-11-22 00:15:58,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:15:58,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:15:58,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-11-22 00:15:58,042 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-22 00:15:58,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:15:58,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 127 [2022-11-22 00:15:58,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:15:58,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 127 [2022-11-22 00:15:58,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:15:58,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2022-11-22 00:15:58,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:15:58,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2022-11-22 00:15:58,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:15:58,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 121 [2022-11-22 00:15:58,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:58,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:15:58,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 121 [2022-11-22 00:15:59,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:59,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:15:59,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:59,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:15:59,143 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-22 00:15:59,153 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-22 00:15:59,164 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-22 00:15:59,178 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:59,180 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:59,182 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:59,471 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-22 00:15:59,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:15:59,495 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-22 00:15:59,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:15:59,520 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-22 00:15:59,535 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:59,537 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:59,540 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:15:59,576 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-22 00:15:59,784 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:16:06,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1521982895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:06,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:06,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 5, 5] total 25 [2022-11-22 00:16:06,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041806731] [2022-11-22 00:16:06,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:06,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 00:16:06,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:06,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 00:16:06,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2022-11-22 00:16:06,074 INFO L87 Difference]: Start difference. First operand 54 states and 59 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-22 00:16:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:08,346 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-11-22 00:16:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 00:16:08,349 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 23 [2022-11-22 00:16:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:08,350 INFO L225 Difference]: With dead ends: 86 [2022-11-22 00:16:08,350 INFO L226 Difference]: Without dead ends: 60 [2022-11-22 00:16:08,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-11-22 00:16:08,352 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 45 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:08,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 156 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-22 00:16:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-22 00:16:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-11-22 00:16:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.372093023255814) internal successors, (59), 54 states have internal predecessors, (59), 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-22 00:16:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-22 00:16:08,391 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 23 [2022-11-22 00:16:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:08,392 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-22 00:16:08,392 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-22 00:16:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-22 00:16:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-22 00:16:08,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:08,393 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-22 00:16:08,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:08,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-22 00:16:08,600 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:16:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1091401857, now seen corresponding path program 1 times [2022-11-22 00:16:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:08,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782989124] [2022-11-22 00:16:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:08,783 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-22 00:16:08,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:08,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782989124] [2022-11-22 00:16:08,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782989124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:08,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348571414] [2022-11-22 00:16:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:08,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:08,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:08,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:08,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:16:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:09,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 00:16:09,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:09,080 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-22 00:16:09,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:09,175 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-22 00:16:09,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348571414] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:09,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1259335686] [2022-11-22 00:16:09,179 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-22 00:16:09,179 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:16:09,180 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:16:09,180 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:16:09,180 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:16:09,204 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-22 00:16:09,209 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-22 00:16:09,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 00:16:09,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:16:09,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:16:09,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:09,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:09,620 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-22 00:16:09,630 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-22 00:16:09,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-22 00:16:09,654 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:09,656 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:09,659 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:09,661 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:09,816 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-22 00:16:09,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:09,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:09,844 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-22 00:16:09,852 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-22 00:16:09,864 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:09,865 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:09,867 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:09,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-22 00:16:09,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,942 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 00:16:09,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-22 00:16:09,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:09,967 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 00:16:09,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-22 00:16:10,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:10,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:16:10,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-22 00:16:10,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:16:10,111 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-22 00:16:10,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:10,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:10,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-11-22 00:16:10,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:10,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:10,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-11-22 00:16:10,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:10,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 127 [2022-11-22 00:16:10,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:10,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 127 [2022-11-22 00:16:10,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:10,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2022-11-22 00:16:10,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:10,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 127 [2022-11-22 00:16:10,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:10,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2022-11-22 00:16:10,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:10,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:10,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 121 [2022-11-22 00:16:11,134 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-22 00:16:11,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:11,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:11,153 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-22 00:16:11,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:11,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:11,174 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-22 00:16:11,185 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:11,187 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:11,189 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:11,192 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:11,450 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-22 00:16:11,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:11,470 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-22 00:16:11,478 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-22 00:16:11,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:11,498 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:11,500 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:11,501 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:11,503 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:11,530 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-22 00:16:11,667 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:16:17,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1259335686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:17,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:17,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6, 6, 6] total 26 [2022-11-22 00:16:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267093406] [2022-11-22 00:16:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:17,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 00:16:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:17,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 00:16:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-11-22 00:16:17,733 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-22 00:16:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:19,891 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-11-22 00:16:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 00:16:19,899 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 26 [2022-11-22 00:16:19,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:19,900 INFO L225 Difference]: With dead ends: 62 [2022-11-22 00:16:19,901 INFO L226 Difference]: Without dead ends: 60 [2022-11-22 00:16:19,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2022-11-22 00:16:19,902 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:19,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 145 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-22 00:16:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-22 00:16:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-22 00:16:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 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-22 00:16:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-11-22 00:16:19,914 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 26 [2022-11-22 00:16:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:19,914 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-11-22 00:16:19,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-22 00:16:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-11-22 00:16:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 00:16:19,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:19,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:19,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:20,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:20,122 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:16:20,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1050377432, now seen corresponding path program 1 times [2022-11-22 00:16:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:20,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352530720] [2022-11-22 00:16:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:16:20,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:20,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352530720] [2022-11-22 00:16:20,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352530720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:20,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549378250] [2022-11-22 00:16:20,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:20,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:20,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:20,392 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:20,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:16:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:20,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 00:16:20,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:16:20,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:16:20,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549378250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:20,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1339474439] [2022-11-22 00:16:20,802 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-22 00:16:20,803 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:16:20,803 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:16:20,803 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:16:20,804 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:16:20,842 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-22 00:16:20,849 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-22 00:16:20,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:20,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:20,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:16:20,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:20,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:20,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 00:16:20,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:20,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:20,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:16:21,015 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-22 00:16:21,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:21,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:21,046 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-22 00:16:21,055 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-22 00:16:21,101 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-22 00:16:21,111 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-22 00:16:21,128 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-22 00:16:21,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:21,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:21,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:21,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-22 00:16:21,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:21,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:21,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:21,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:21,305 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-22 00:16:21,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 330 [2022-11-22 00:16:21,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:21,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:21,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:21,358 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 00:16:21,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 324 treesize of output 229 [2022-11-22 00:16:21,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-11-22 00:16:21,424 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-22 00:16:21,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 55 [2022-11-22 00:16:21,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-11-22 00:16:21,458 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-22 00:16:21,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 2 case distinctions, treesize of input 49 treesize of output 30 [2022-11-22 00:16:21,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-22 00:16:21,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:16:21,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-22 00:16:21,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:21,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:21,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:16:21,825 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-22 00:16:21,838 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-22 00:16:21,849 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-22 00:16:22,074 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-22 00:16:22,084 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-22 00:16:22,094 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-22 00:16:22,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 19 treesize of output 1 [2022-11-22 00:16:22,334 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-22 00:16:22,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 00:16:22,445 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-22 00:16:22,454 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-22 00:16:22,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:22,473 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-22 00:16:22,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:22,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:22,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:22,557 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-22 00:16:22,568 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-22 00:16:22,576 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-22 00:16:22,609 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-22 00:16:22,766 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:16:27,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1339474439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:27,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:27,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [8, 8, 8] total 24 [2022-11-22 00:16:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577125889] [2022-11-22 00:16:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:27,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 00:16:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:27,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 00:16:27,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-11-22 00:16:27,668 INFO L87 Difference]: Start difference. First operand 60 states and 65 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-22 00:16:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:30,153 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-11-22 00:16:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 00:16:30,154 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 29 [2022-11-22 00:16:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:30,156 INFO L225 Difference]: With dead ends: 60 [2022-11-22 00:16:30,156 INFO L226 Difference]: Without dead ends: 54 [2022-11-22 00:16:30,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2022-11-22 00:16:30,159 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 66 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:30,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 109 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 00:16:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-22 00:16:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-11-22 00:16:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:16:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-11-22 00:16:30,177 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 29 [2022-11-22 00:16:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:30,179 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-11-22 00:16:30,179 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-22 00:16:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-11-22 00:16:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 00:16:30,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:30,186 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-22 00:16:30,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:30,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:30,394 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:16:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1758972132, now seen corresponding path program 1 times [2022-11-22 00:16:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:30,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469369621] [2022-11-22 00:16:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:30,685 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-22 00:16:30,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:30,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469369621] [2022-11-22 00:16:30,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469369621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:30,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357420842] [2022-11-22 00:16:30,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:30,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:30,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:30,688 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:30,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 00:16:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:30,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:16:30,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 00:16:31,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 00:16:31,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357420842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:31,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [214887772] [2022-11-22 00:16:31,106 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-22 00:16:31,106 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:16:31,106 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:16:31,107 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:16:31,107 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:16:31,132 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-22 00:16:31,137 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-22 00:16:31,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 00:16:31,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:16:31,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:16:31,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:31,417 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-22 00:16:31,425 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-22 00:16:31,433 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-22 00:16:31,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:31,451 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:31,453 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:31,455 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:31,615 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-22 00:16:31,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:31,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:31,646 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-22 00:16:31,655 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-22 00:16:31,666 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:31,669 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:31,671 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:31,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-22 00:16:31,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,744 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 00:16:31,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-22 00:16:31,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,773 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 00:16:31,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-22 00:16:31,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:16:31,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:31,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:16:31,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:31,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-22 00:16:32,101 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-22 00:16:32,121 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-22 00:16:32,132 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-22 00:16:32,353 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-22 00:16:32,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 00:16:32,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 00:16:32,545 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-22 00:16:32,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 00:16:32,564 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-22 00:16:33,130 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-22 00:16:33,139 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-22 00:16:33,150 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-22 00:16:33,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-22 00:16:33,409 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-22 00:16:33,416 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-22 00:16:33,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:33,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:33,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:33,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:33,446 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:33,448 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:33,450 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:33,607 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-22 00:16:33,615 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-22 00:16:33,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-22 00:16:33,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:33,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:33,650 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:33,651 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:33,653 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:33,676 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-22 00:16:33,815 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:16:40,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [214887772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:40,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:40,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [8, 5, 5] total 33 [2022-11-22 00:16:40,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041087451] [2022-11-22 00:16:40,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:40,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 00:16:40,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:40,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 00:16:40,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2022-11-22 00:16:40,543 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 20 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:16:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:45,483 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-11-22 00:16:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 00:16:45,483 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-11-22 00:16:45,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:45,484 INFO L225 Difference]: With dead ends: 73 [2022-11-22 00:16:45,484 INFO L226 Difference]: Without dead ends: 69 [2022-11-22 00:16:45,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 83 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=354, Invalid=1538, Unknown=0, NotChecked=0, Total=1892 [2022-11-22 00:16:45,486 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 77 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:45,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 107 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-22 00:16:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-22 00:16:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2022-11-22 00:16:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 52 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-22 00:16:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-11-22 00:16:45,508 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 40 [2022-11-22 00:16:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:45,509 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-11-22 00:16:45,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:16:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-11-22 00:16:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 00:16:45,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:45,510 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-22 00:16:45,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:45,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 00:16:45,719 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:16:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1357079599, now seen corresponding path program 1 times [2022-11-22 00:16:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:45,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985216933] [2022-11-22 00:16:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:45,937 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-22 00:16:45,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:45,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985216933] [2022-11-22 00:16:45,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985216933] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:45,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134821576] [2022-11-22 00:16:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:45,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:45,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:45,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:45,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 00:16:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:46,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 00:16:46,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:46,261 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-22 00:16:46,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:46,348 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-22 00:16:46,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134821576] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:46,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1716303417] [2022-11-22 00:16:46,351 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-11-22 00:16:46,351 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:16:46,352 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:16:46,352 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:16:46,352 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:16:46,380 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-22 00:16:46,385 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-22 00:16:46,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:46,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:46,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:16:46,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:46,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:46,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 00:16:46,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:46,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:46,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:16:46,737 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-22 00:16:46,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:46,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:46,762 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-22 00:16:46,769 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-22 00:16:46,778 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:46,780 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:46,781 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:46,784 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:46,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:46,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:46,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:46,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:46,986 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-22 00:16:46,995 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-22 00:16:47,003 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-22 00:16:47,013 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:47,014 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:47,016 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:47,018 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:47,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-22 00:16:47,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,149 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-22 00:16:47,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 334 [2022-11-22 00:16:47,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,187 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 00:16:47,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 340 treesize of output 246 [2022-11-22 00:16:47,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13 [2022-11-22 00:16:47,245 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-22 00:16:47,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 118 [2022-11-22 00:16:47,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 78 [2022-11-22 00:16:47,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-22 00:16:47,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:16:47,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:16:47,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,687 INFO L321 Elim1Store]: treesize reduction 112, result has 17.6 percent of original size [2022-11-22 00:16:47,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 323 treesize of output 303 [2022-11-22 00:16:47,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:47,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:47,760 INFO L321 Elim1Store]: treesize reduction 112, result has 17.6 percent of original size [2022-11-22 00:16:47,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 323 treesize of output 303 [2022-11-22 00:16:47,854 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-22 00:16:48,115 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-22 00:16:48,123 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-22 00:16:48,133 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-22 00:16:48,690 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-22 00:16:48,697 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-22 00:16:48,708 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-22 00:16:49,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:49,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:49,033 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-22 00:16:49,041 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-22 00:16:49,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:49,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:16:49,060 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-22 00:16:49,072 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:49,074 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:49,076 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:49,078 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:49,321 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-22 00:16:49,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-22 00:16:49,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:49,352 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-22 00:16:49,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:16:49,377 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:49,379 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:49,382 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:49,385 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 00:16:49,413 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-22 00:16:49,572 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:16:57,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1716303417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:57,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:57,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 33 [2022-11-22 00:16:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432084444] [2022-11-22 00:16:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:57,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-22 00:16:57,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:57,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-22 00:16:57,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=963, Unknown=2, NotChecked=0, Total=1122 [2022-11-22 00:16:57,684 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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-22 00:17:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:03,057 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-22 00:17:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 00:17:03,058 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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 43 [2022-11-22 00:17:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:03,059 INFO L225 Difference]: With dead ends: 70 [2022-11-22 00:17:03,059 INFO L226 Difference]: Without dead ends: 68 [2022-11-22 00:17:03,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 90 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=280, Invalid=1698, Unknown=2, NotChecked=0, Total=1980 [2022-11-22 00:17:03,061 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 79 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:03,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 86 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-22 00:17:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-22 00:17:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-11-22 00:17:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 54 states have internal predecessors, (60), 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-22 00:17:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-22 00:17:03,082 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 43 [2022-11-22 00:17:03,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:03,083 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-22 00:17:03,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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-22 00:17:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-22 00:17:03,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 00:17:03,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:03,084 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-11-22 00:17:03,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-22 00:17:03,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 00:17:03,291 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:17:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash -231049583, now seen corresponding path program 1 times [2022-11-22 00:17:03,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:03,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270725589] [2022-11-22 00:17:03,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:03,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 00:17:03,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:03,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270725589] [2022-11-22 00:17:03,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270725589] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:03,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816101312] [2022-11-22 00:17:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:03,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:03,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:03,477 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:03,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 00:17:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:03,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 00:17:03,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 00:17:03,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 00:17:03,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816101312] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:17:03,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1831496646] [2022-11-22 00:17:03,898 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-22 00:17:03,898 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:17:03,898 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:17:03,899 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:17:03,899 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:17:03,929 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-22 00:17:03,934 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-22 00:17:03,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:03,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:03,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:17:03,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:03,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:03,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 00:17:03,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:03,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:03,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:17:04,093 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-22 00:17:04,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:17:04,114 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-22 00:17:04,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:17:04,146 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-22 00:17:04,193 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-22 00:17:04,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:17:04,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:17:04,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-22 00:17:04,245 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-22 00:17:04,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-22 00:17:04,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,339 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 00:17:04,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-22 00:17:04,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,371 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 00:17:04,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-22 00:17:04,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:17:04,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-22 00:17:04,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:04,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:04,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:17:04,625 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-22 00:17:04,635 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-22 00:17:04,646 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-22 00:17:04,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 00:17:04,830 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-22 00:17:04,839 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-22 00:17:04,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 00:17:05,002 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-22 00:17:05,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 19 treesize of output 1 [2022-11-22 00:17:06,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:17:06,354 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-22 00:17:06,365 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-22 00:17:06,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:06,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:17:06,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:06,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:17:06,474 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-22 00:17:06,484 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-22 00:17:06,493 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-22 00:17:06,535 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-22 00:17:06,571 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-22 00:17:06,581 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-22 00:17:06,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:06,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:17:06,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:06,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 00:17:06,638 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 84 for LOIs [2022-11-22 00:17:06,803 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:17:14,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1831496646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:17:14,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:17:14,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [8, 8, 8] total 31 [2022-11-22 00:17:14,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124702006] [2022-11-22 00:17:14,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:17:14,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 00:17:14,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:14,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 00:17:14,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2022-11-22 00:17:14,220 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 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-22 00:17:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:20,889 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-22 00:17:20,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-22 00:17:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 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 46 [2022-11-22 00:17:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:20,891 INFO L225 Difference]: With dead ends: 63 [2022-11-22 00:17:20,891 INFO L226 Difference]: Without dead ends: 58 [2022-11-22 00:17:20,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 99 SyntacticMatches, 17 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=287, Invalid=1969, Unknown=0, NotChecked=0, Total=2256 [2022-11-22 00:17:20,892 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:20,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 2 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-22 00:17:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-22 00:17:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-11-22 00:17:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:17:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-11-22 00:17:20,912 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 46 [2022-11-22 00:17:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:20,912 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-11-22 00:17:20,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 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-22 00:17:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-11-22 00:17:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-22 00:17:20,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:20,914 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-22 00:17:20,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 00:17:21,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:21,122 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:17:21,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1427486198, now seen corresponding path program 1 times [2022-11-22 00:17:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:21,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501208823] [2022-11-22 00:17:21,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:21,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-22 00:17:21,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:21,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501208823] [2022-11-22 00:17:21,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501208823] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:21,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417147838] [2022-11-22 00:17:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:21,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:21,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:21,264 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:21,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 00:17:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:21,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:17:21,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-22 00:17:21,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-22 00:17:21,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417147838] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:17:21,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2078443886] [2022-11-22 00:17:21,715 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-22 00:17:21,715 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:17:21,716 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:17:21,716 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:17:21,716 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:17:21,742 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-22 00:17:21,750 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-22 00:17:21,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:21,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:21,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:17:21,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:21,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:21,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:17:21,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:21,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:21,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 00:17:21,919 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-22 00:17:21,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:21,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-22 00:17:21,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:21,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-22 00:17:22,014 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-22 00:17:22,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-22 00:17:22,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:22,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:22,060 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-22 00:17:22,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:22,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:22,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-22 00:17:22,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:22,139 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 00:17:22,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-22 00:17:22,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:22,168 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 00:17:22,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-22 00:17:22,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:22,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:22,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:17:22,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:22,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-22 00:17:22,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:22,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:17:22,430 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-22 00:17:22,442 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-22 00:17:22,453 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-22 00:17:22,655 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-22 00:17:22,666 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-22 00:17:22,676 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-22 00:17:22,860 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-22 00:17:22,871 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-22 00:17:22,888 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-22 00:17:24,006 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-22 00:17:24,023 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-22 00:17:24,034 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-22 00:17:24,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:24,128 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-22 00:17:24,139 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-22 00:17:24,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:24,162 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-22 00:17:24,201 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-22 00:17:24,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-22 00:17:24,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:24,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:24,242 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-22 00:17:24,268 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-22 00:17:24,431 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:17:31,529 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4546#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (< 2147483646 |ULTIMATE.start_main_#t~post16#1|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-22 00:17:31,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 00:17:31,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:17:31,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-22 00:17:31,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287559434] [2022-11-22 00:17:31,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:17:31,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 00:17:31,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:31,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 00:17:31,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=979, Unknown=1, NotChecked=0, Total=1122 [2022-11-22 00:17:31,532 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 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-22 00:17:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:31,810 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2022-11-22 00:17:31,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:17:31,811 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 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 47 [2022-11-22 00:17:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:31,815 INFO L225 Difference]: With dead ends: 102 [2022-11-22 00:17:31,815 INFO L226 Difference]: Without dead ends: 101 [2022-11-22 00:17:31,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 103 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=178, Invalid=1227, Unknown=1, NotChecked=0, Total=1406 [2022-11-22 00:17:31,817 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:31,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 82 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:17:31,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-22 00:17:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-11-22 00:17:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.1318681318681318) internal successors, (103), 91 states have internal predecessors, (103), 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-22 00:17:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-11-22 00:17:31,864 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 47 [2022-11-22 00:17:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:31,864 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-11-22 00:17:31,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 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-22 00:17:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-11-22 00:17:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-22 00:17:31,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:31,865 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:31,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-22 00:17:32,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 00:17:32,066 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 00:17:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:32,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1985406755, now seen corresponding path program 2 times [2022-11-22 00:17:32,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:32,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913411113] [2022-11-22 00:17:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 37 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-22 00:17:32,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:32,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913411113] [2022-11-22 00:17:32,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913411113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162116335] [2022-11-22 00:17:32,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:17:32,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:32,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:32,245 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:32,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 00:17:32,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 00:17:32,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:17:32,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:17:32,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-22 00:17:32,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-22 00:17:32,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162116335] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:17:32,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2069937389] [2022-11-22 00:17:32,800 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-22 00:17:32,800 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:17:32,801 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:17:32,801 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:17:32,801 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:17:32,833 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-22 00:17:32,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 00:17:32,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:32,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:32,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 00:17:32,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:32,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:32,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:17:32,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:32,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:32,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-22 00:17:32,986 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-22 00:17:33,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:33,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:33,024 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-22 00:17:33,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-22 00:17:33,085 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-22 00:17:33,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:33,105 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-22 00:17:33,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:33,129 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-22 00:17:33,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:33,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:33,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:33,177 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 00:17:33,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2022-11-22 00:17:33,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:33,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:33,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:33,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-22 00:17:33,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:33,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:33,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:33,244 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 00:17:33,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2022-11-22 00:17:33,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:33,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-22 00:17:33,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:33,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:33,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:17:33,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:33,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-22 00:17:33,510 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-22 00:17:33,518 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-22 00:17:33,532 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-22 00:17:33,657 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-22 00:17:33,671 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-22 00:17:33,683 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-22 00:17:33,835 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-22 00:17:33,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:17:33,854 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-22 00:17:34,705 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-22 00:17:34,714 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-22 00:17:34,721 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-22 00:17:34,773 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-22 00:17:34,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:34,789 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-22 00:17:34,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:34,809 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-22 00:17:34,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-22 00:17:34,852 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-22 00:17:34,859 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-22 00:17:34,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:34,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:17:34,895 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-22 00:17:35,030 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:17:43,059 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5260#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (< 2147483646 |ULTIMATE.start_main_#t~post16#1|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |#NULL.base| 0))) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-22 00:17:43,059 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 00:17:43,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:17:43,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-11-22 00:17:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269329662] [2022-11-22 00:17:43,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:17:43,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 00:17:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:43,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 00:17:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2022-11-22 00:17:43,061 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 00:17:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:43,480 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-11-22 00:17:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 00:17:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2022-11-22 00:17:43,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:43,482 INFO L225 Difference]: With dead ends: 120 [2022-11-22 00:17:43,482 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 00:17:43,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 166 SyntacticMatches, 12 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=282, Invalid=1524, Unknown=0, NotChecked=0, Total=1806 [2022-11-22 00:17:43,484 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:43,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 108 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:17:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 00:17:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 00:17:43,486 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-22 00:17:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 00:17:43,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2022-11-22 00:17:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:43,486 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 00:17:43,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 00:17:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 00:17:43,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 00:17:43,489 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-22 00:17:43,490 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-22 00:17:43,490 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-22 00:17:43,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-22 00:17:43,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-22 00:17:43,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-22 00:17:43,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-22 00:17:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-22 00:17:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-22 00:17:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-22 00:17:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-22 00:17:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-22 00:17:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-22 00:17:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-22 00:17:43,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 00:17:43,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 00:17:43,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 00:17:49,195 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-11-22 00:17:49,195 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2022-11-22 00:17:49,196 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select |#memory_int| 1))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_circular_create_~data#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8))) (= (select .cse1 4) 0) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (= (select .cse2 0) 48) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse1 0) 0) (= (select .cse2 1) 0) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-22 00:17:49,196 INFO L899 garLoopResultBuilder]: For program point L622-1(line 622) no Hoare annotation was computed. [2022-11-22 00:17:49,198 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-11-22 00:17:49,199 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-11-22 00:17:49,199 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-11-22 00:17:49,199 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 00:17:49,199 INFO L899 garLoopResultBuilder]: For program point L631-3(line 631) no Hoare annotation was computed. [2022-11-22 00:17:49,200 INFO L899 garLoopResultBuilder]: For program point L631-4(line 631) no Hoare annotation was computed. [2022-11-22 00:17:49,200 INFO L895 garLoopResultBuilder]: At program point L631-5(lines 631 634) the Hoare annotation is: (let ((.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse4 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse12 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse13 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse14 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse17 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse18 (= |#NULL.base| 0))) (or (let ((.cse0 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (and (<= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse7 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse8 .cse9 .cse10 .cse11 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse12 (<= 1 |ULTIMATE.start_main_~data~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse18)) (and (<= 2 |ULTIMATE.start_dll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 2) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 4) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 0 (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 2) (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 4) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~new_data~0#1| 4) (= |ULTIMATE.start_main_~data~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) .cse12 (<= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse13 .cse14 .cse15 .cse16 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~index#1|) .cse17 .cse18))) [2022-11-22 00:17:49,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-11-22 00:17:49,201 INFO L899 garLoopResultBuilder]: For program point L615(line 615) no Hoare annotation was computed. [2022-11-22 00:17:49,201 INFO L899 garLoopResultBuilder]: For program point L615-1(line 615) no Hoare annotation was computed. [2022-11-22 00:17:49,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-11-22 00:17:49,201 INFO L899 garLoopResultBuilder]: For program point L632(line 632) no Hoare annotation was computed. [2022-11-22 00:17:49,201 INFO L899 garLoopResultBuilder]: For program point L632-1(line 632) no Hoare annotation was computed. [2022-11-22 00:17:49,202 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-11-22 00:17:49,202 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-11-22 00:17:49,202 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-11-22 00:17:49,202 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-11-22 00:17:49,202 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-22 00:17:49,203 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-11-22 00:17:49,203 INFO L899 garLoopResultBuilder]: For program point L635-3(line 635) no Hoare annotation was computed. [2022-11-22 00:17:49,203 INFO L899 garLoopResultBuilder]: For program point L635-4(line 635) no Hoare annotation was computed. [2022-11-22 00:17:49,203 INFO L895 garLoopResultBuilder]: At program point L635-5(lines 635 640) the Hoare annotation is: (and (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse4 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse13 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse15 (<= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) .cse2 (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 |ULTIMATE.start_main_~expected~0#1|) .cse14 (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) .cse15 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0)) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) (< |ULTIMATE.start_main_~i~0#1| 2147483647) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-22 00:17:49,204 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-11-22 00:17:49,204 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-22 00:17:49,204 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-11-22 00:17:49,204 INFO L902 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-11-22 00:17:49,204 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 00:17:49,204 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-22 00:17:49,204 INFO L899 garLoopResultBuilder]: For program point L636(line 636) no Hoare annotation was computed. [2022-11-22 00:17:49,205 INFO L899 garLoopResultBuilder]: For program point L636-1(line 636) no Hoare annotation was computed. [2022-11-22 00:17:49,205 INFO L899 garLoopResultBuilder]: For program point L595(line 595) no Hoare annotation was computed. [2022-11-22 00:17:49,205 INFO L899 garLoopResultBuilder]: For program point L595-1(line 595) no Hoare annotation was computed. [2022-11-22 00:17:49,205 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-11-22 00:17:49,206 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_dll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 2) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 4) (<= 0 (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 2) (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 4) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~new_data~0#1| 4) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~index#1|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-22 00:17:49,206 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-11-22 00:17:49,206 INFO L895 garLoopResultBuilder]: At program point L637(lines 637 639) the Hoare annotation is: (and (<= |ULTIMATE.start_main_#t~ret17#1| 2147483647) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| 4) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= 0 (+ |ULTIMATE.start_main_#t~ret17#1| 2147483648)) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_#t~ret17#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0)) [2022-11-22 00:17:49,207 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-11-22 00:17:49,207 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |#NULL.offset| 0)) (.cse5 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse8 (= |#NULL.base| 0))) (or (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (select |#memory_int| 1))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) .cse1 (= |ULTIMATE.start_dll_circular_create_~data#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8))) (= (select .cse2 4) 0) (= (select |#valid| 0) 0) .cse3 (= (select |#valid| 2) 1) .cse4 .cse5 (= (select .cse6 0) 48) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse2 0) 0) (= (select .cse6 1) 0) .cse7 (< 0 |#StackHeapBarrier|) .cse8)) (and (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse1 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) .cse3 .cse4 .cse5 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse7 (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse8))) [2022-11-22 00:17:49,207 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-11-22 00:17:49,208 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| 4) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0)) [2022-11-22 00:17:49,208 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-11-22 00:17:49,208 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-11-22 00:17:49,209 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 575 584) the Hoare annotation is: (or (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse1 (not (< 0 |#StackHeapBarrier|))) (.cse2 (not (= |#NULL.base| 0)))) (and (or .cse0 .cse1 .cse2 (forall ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28|) 8)) (.cse4 (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28|)) (.cse5 (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28|))) (or (not (= .cse3 |node_create_#in~data#1|)) (not (= 0 (select .cse4 0))) (not (< |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28| |#StackHeapBarrier|)) (= |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28| 0) (not (= .cse3 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28|) 1)) (not (= (select |old(#length)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_28|) 12)) (not (= (select .cse5 0) 0)) (not (= (select .cse4 4) 0)) (not (= (select .cse5 4) 0)))))) (let ((.cse6 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 .cse1 .cse2 (not (= |node_create_#in~data#1| 1)) (not (= (select |old(#length)| 1) 2)) (not (= (select .cse6 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse6 1) 0)) (not (= 19 (select |old(#length)| 2))))))) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-11-22 00:17:49,210 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-11-22 00:17:49,214 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:49,217 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:17:49,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,249 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,250 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:17:49 BoogieIcfgContainer [2022-11-22 00:17:49,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:17:49,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:17:49,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:17:49,266 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:17:49,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:51" (3/4) ... [2022-11-22 00:17:49,270 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 00:17:49,278 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-22 00:17:49,284 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2022-11-22 00:17:49,285 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-22 00:17:49,285 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 00:17:49,286 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 00:17:49,317 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && 2 == unknown-#length-unknown[1]) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && data == 1) && data == unknown-#memory_int-unknown[head][head + 8]) && #memory_$Pointer$[head][4] == 0) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && 1 <= data) && unknown-#memory_int-unknown[1][0] == 48) && head == last) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) [2022-11-22 00:17:49,318 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((data <= 1 && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && i == 0) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && 1 <= \old(data)) && \result == s) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && #memory_$Pointer$[last][last] == head) && \old(len) <= 2) && 1 <= data) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && \result == head) && #NULL == 0) || ((((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && 2 <= data) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data <= 4) && i <= 2) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && \old(data) <= 4) && 0 <= i) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) [2022-11-22 00:17:49,319 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((0 <= s && 2 <= \old(len)) && 1 <= i) && 2 <= \result) && 0 <= \old(index)) && 1 <= len) && 0 <= index) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && 2 <= expected) && len <= 1) && 0 <= head) && s <= 0) && head <= 0) || ((((((((((((((((0 <= s && i == 0) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && len <= 1) && s <= 0)) && i < 2147483647) && \old(len) <= 2) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0 [2022-11-22 00:17:49,319 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && 2 <= data) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data <= 4) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && \old(data) <= 4) && 0 <= i) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0 [2022-11-22 00:17:49,320 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((0 <= s && expected <= 4) && 2 <= \old(len)) && 0 <= \old(index)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) <= 2) && 0 <= i) && data == 1) && 1 <= \old(data)) && index <= 2) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= expected) && len <= 1) && 0 <= head) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && head <= 0 [2022-11-22 00:17:49,321 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= s) && expected <= 4) && 2 <= \old(len)) && 0 <= \old(index)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && \old(index) <= 2) && 0 <= i) && data == 1) && 1 <= \old(data)) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= expected) && len <= 1) && 0 <= head) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && head <= 0 [2022-11-22 00:17:49,338 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:17:49,338 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:17:49,339 INFO L158 Benchmark]: Toolchain (without parser) took 119251.69ms. Allocated memory was 142.6MB in the beginning and 383.8MB in the end (delta: 241.2MB). Free memory was 96.5MB in the beginning and 243.6MB in the end (delta: -147.1MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2022-11-22 00:17:49,339 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 142.6MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:17:49,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.56ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 78.5MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-22 00:17:49,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.89ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 76.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:17:49,340 INFO L158 Benchmark]: Boogie Preprocessor took 61.55ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 74.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:17:49,341 INFO L158 Benchmark]: RCFGBuilder took 751.27ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 74.8MB in the beginning and 146.0MB in the end (delta: -71.2MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2022-11-22 00:17:49,341 INFO L158 Benchmark]: TraceAbstraction took 117814.89ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 146.0MB in the beginning and 247.8MB in the end (delta: -101.8MB). Peak memory consumption was 232.8MB. Max. memory is 16.1GB. [2022-11-22 00:17:49,341 INFO L158 Benchmark]: Witness Printer took 72.98ms. Allocated memory is still 383.8MB. Free memory was 247.8MB in the beginning and 243.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 00:17:49,343 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.25ms. Allocated memory is still 142.6MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.56ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 78.5MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.89ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 76.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.55ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 74.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 751.27ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 74.8MB in the beginning and 146.0MB in the end (delta: -71.2MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 117814.89ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 146.0MB in the beginning and 247.8MB in the end (delta: -101.8MB). Peak memory consumption was 232.8MB. Max. memory is 16.1GB. * Witness Printer took 72.98ms. Allocated memory is still 383.8MB. Free memory was 247.8MB in the beginning and 243.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 117.7s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 769 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 768 mSDsluCounter, 1652 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1204 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3325 IncrementalHoareTripleChecker+Invalid, 3450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 448 mSDtfsCounter, 3325 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1149 GetRequests, 741 SyntacticMatches, 85 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3559 ImplicationChecksByTransitivity, 72.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=17, InterpolantAutomatonStates: 181, 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, 18 MinimizatonAttempts, 157 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 42 NumberOfFragments, 1213 HoareAnnotationTreeSize, 16 FomulaSimplifications, 18160 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 12 FomulaSimplificationsInter, 7931 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 857 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1143 ConstructedInterpolants, 0 QuantifiedInterpolants, 2479 SizeOfPredicates, 26 NumberOfNonLiveVariables, 3358 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 36 InterpolantComputations, 10 PerfectInterpolantSequences, 478/621 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: 16.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 159, DAG_INTERPRETER_EARLY_EXITS: 12, TOOLS_POST_APPLICATIONS: 383, TOOLS_POST_TIME: 8.7s, TOOLS_POST_CALL_APPLICATIONS: 48, TOOLS_POST_CALL_TIME: 3.4s, TOOLS_POST_RETURN_APPLICATIONS: 36, TOOLS_POST_RETURN_TIME: 2.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 467, TOOLS_QUANTIFIERELIM_TIME: 14.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 713, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 72, DOMAIN_JOIN_TIME: 0.9s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 12, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 45, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 159, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 33, LOOP_SUMMARIZER_CACHE_MISSES: 33, LOOP_SUMMARIZER_OVERALL_TIME: 4.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 45, CALL_SUMMARIZER_APPLICATIONS: 36, CALL_SUMMARIZER_CACHE_MISSES: 6, CALL_SUMMARIZER_OVERALL_TIME: 0.4s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.4s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 4014, DAG_COMPRESSION_RETAINED_NODES: 551, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && 2 <= data) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data <= 4) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && \old(data) <= 4) && 0 <= i) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= s) && expected <= 4) && 2 <= \old(len)) && 0 <= \old(index)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && \old(index) <= 2) && 0 <= i) && data == 1) && 1 <= \old(data)) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= expected) && len <= 1) && 0 <= head) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && head <= 0 - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-11-22 00:17:49,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((data <= 1 && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && i == 0) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && 1 <= \old(data)) && \result == s) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && #memory_$Pointer$[last][last] == head) && \old(len) <= 2) && 1 <= data) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && \result == head) && #NULL == 0) || ((((((((((((((((((((((((((((((((((2 <= \old(data) && index <= 2) && 0 <= s) && 0 <= head) && 2 <= data) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data <= 4) && i <= 2) && 0 <= index + 1) && head <= 0) && \old(index) <= 2) && \old(data) <= 4) && 0 <= i) && new_data <= 4) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= new_data) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= \old(index)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((0 <= s && 2 <= \old(len)) && 1 <= i) && 2 <= \result) && 0 <= \old(index)) && 1 <= len) && 0 <= index) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && 2 <= expected) && len <= 1) && 0 <= head) && s <= 0) && head <= 0) || ((((((((((((((((0 <= s && i == 0) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && len <= 1) && s <= 0)) && i < 2147483647) && \old(len) <= 2) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 588]: Loop Invariant [2022-11-22 00:17:49,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,368 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-22 00:17:49,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-22 00:17:49,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && 2 == unknown-#length-unknown[1]) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && data == 1) && data == unknown-#memory_int-unknown[head][head + 8]) && #memory_$Pointer$[head][4] == 0) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && 1 <= data) && unknown-#memory_int-unknown[1][0] == 48) && head == last) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((0 <= s && expected <= 4) && 2 <= \old(len)) && 0 <= \old(index)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) <= 2) && 0 <= i) && data == 1) && 1 <= \old(data)) && index <= 2) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && 2 <= expected) && len <= 1) && 0 <= head) && data <= 1) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && head <= 0 - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-22 00:17:49,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c06e3e8-0728-4d70-ace0-38d703416329/bin/utaipan-g80aRyZoba/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