./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-regression/test22-1.c --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_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/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_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test22-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/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_439e1d5e-e0e8-48de-969c-6b63efa0070c/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 e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f --- 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 02:33:49,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:33:49,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:33:49,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:33:49,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:33:49,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:33:49,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:33:49,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:33:49,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:33:49,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:33:49,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:33:49,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:33:49,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:33:49,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:33:49,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:33:49,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:33:49,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:33:49,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:33:49,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:33:49,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:33:49,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:33:49,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:33:49,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:33:49,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:33:49,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:33:49,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:33:49,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:33:49,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:33:49,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:33:49,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:33:49,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:33:49,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:33:49,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:33:49,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:33:49,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:33:49,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:33:49,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:33:49,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:33:49,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:33:49,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:33:49,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:33:49,355 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 02:33:49,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:33:49,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:33:49,394 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:33:49,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:33:49,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:33:49,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:33:49,396 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:33:49,397 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:33:49,397 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:33:49,397 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:33:49,398 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:33:49,399 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:33:49,399 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:33:49,399 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:33:49,400 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:33:49,400 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:33:49,400 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:33:49,401 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:33:49,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:33:49,402 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:33:49,403 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:33:49,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:33:49,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:33:49,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:33:49,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:33:49,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:33:49,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:33:49,405 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 02:33:49,406 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:33:49,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:33:49,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:33:49,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:33:49,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:33:49,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:33:49,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:33:49,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:33:49,408 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:33:49,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:33:49,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:33:49,409 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:33:49,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:33:49,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:33:49,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:33:49,410 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_439e1d5e-e0e8-48de-969c-6b63efa0070c/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_439e1d5e-e0e8-48de-969c-6b63efa0070c/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 -> e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f [2022-11-22 02:33:49,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:33:49,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:33:49,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:33:49,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:33:49,764 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:33:49,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/ldv-regression/test22-1.c [2022-11-22 02:33:52,881 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:33:53,134 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:33:53,134 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/sv-benchmarks/c/ldv-regression/test22-1.c [2022-11-22 02:33:53,141 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/data/c77853fc4/d7628f0da3c64e8eafbe40ce2d03e431/FLAG8a1f0b5b9 [2022-11-22 02:33:53,154 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/data/c77853fc4/d7628f0da3c64e8eafbe40ce2d03e431 [2022-11-22 02:33:53,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:33:53,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:33:53,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:33:53,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:33:53,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:33:53,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b347ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53, skipping insertion in model container [2022-11-22 02:33:53,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:33:53,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:33:53,351 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_439e1d5e-e0e8-48de-969c-6b63efa0070c/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2022-11-22 02:33:53,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:33:53,361 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:33:53,377 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_439e1d5e-e0e8-48de-969c-6b63efa0070c/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2022-11-22 02:33:53,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:33:53,394 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:33:53,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53 WrapperNode [2022-11-22 02:33:53,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:33:53,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:33:53,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:33:53,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:33:53,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,433 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-11-22 02:33:53,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:33:53,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:33:53,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:33:53,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:33:53,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,459 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:33:53,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:33:53,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:33:53,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:33:53,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (1/1) ... [2022-11-22 02:33:53,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:33:53,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:33:53,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:33:53,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:33:53,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:33:53,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:33:53,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:33:53,541 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2022-11-22 02:33:53,541 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2022-11-22 02:33:53,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:33:53,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:33:53,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:33:53,623 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:33:53,625 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:33:53,779 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:33:53,829 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:33:53,829 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-22 02:33:53,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:33:53 BoogieIcfgContainer [2022-11-22 02:33:53,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:33:53,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:33:53,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:33:53,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:33:53,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:33:53" (1/3) ... [2022-11-22 02:33:53,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3995975a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:33:53, skipping insertion in model container [2022-11-22 02:33:53,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:33:53" (2/3) ... [2022-11-22 02:33:53,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3995975a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:33:53, skipping insertion in model container [2022-11-22 02:33:53,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:33:53" (3/3) ... [2022-11-22 02:33:53,842 INFO L112 eAbstractionObserver]: Analyzing ICFG test22-1.c [2022-11-22 02:33:53,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:33:53,862 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-22 02:33:53,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:33:53,914 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8fddf3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:33:53,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-22 02:33:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 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 02:33:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:33:53,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:33:53,925 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:33:53,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 02:33:53,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:33:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1545319897, now seen corresponding path program 1 times [2022-11-22 02:33:53,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:33:53,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123321024] [2022-11-22 02:33:53,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:33:53,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:33:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:33:55,518 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 02:33:55,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:33:55,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123321024] [2022-11-22 02:33:55,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123321024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:33:55,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412884925] [2022-11-22 02:33:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:33:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:33:55,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:33:55,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:33:55,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:33:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:33:55,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-22 02:33:55,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:33:55,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:55,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:55,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2022-11-22 02:33:56,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:33:56,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:33:56,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2022-11-22 02:33:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:33:56,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:33:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 02:33:57,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412884925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:33:57,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2105383354] [2022-11-22 02:33:57,135 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-22 02:33:57,135 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:33:57,138 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:33:57,144 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:33:57,145 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:33:57,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:57,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:57,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2022-11-22 02:33:58,353 INFO L197 IcfgInterpreter]: Interpreting procedure get_dummy with input of size 77 for LOIs [2022-11-22 02:33:58,371 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:34:01,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2105383354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:34:01,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:34:01,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 7, 7] total 30 [2022-11-22 02:34:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220544679] [2022-11-22 02:34:01,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:34:01,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 02:34:01,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:34:01,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 02:34:01,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:34:01,876 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 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) Second operand has 11 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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 02:34:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:34:02,336 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-11-22 02:34:02,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 02:34:02,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) Word has length 15 [2022-11-22 02:34:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:34:02,347 INFO L225 Difference]: With dead ends: 30 [2022-11-22 02:34:02,347 INFO L226 Difference]: Without dead ends: 18 [2022-11-22 02:34:02,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:34:02,356 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:34:02,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 48 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:34:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-22 02:34:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-22 02:34:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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 02:34:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-11-22 02:34:02,404 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-11-22 02:34:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:34:02,406 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-22 02:34:02,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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 02:34:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-11-22 02:34:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:34:02,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:34:02,412 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:34:02,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:34:02,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-22 02:34:02,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 02:34:02,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:34:02,622 INFO L85 PathProgramCache]: Analyzing trace with hash -649786592, now seen corresponding path program 1 times [2022-11-22 02:34:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:34:02,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803848361] [2022-11-22 02:34:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:34:02,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:34:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:34:03,312 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 02:34:03,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:34:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803848361] [2022-11-22 02:34:03,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803848361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:34:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683937681] [2022-11-22 02:34:03,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:34:03,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:34:03,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:34:03,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:34:03,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:34:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:34:03,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-22 02:34:03,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:34:03,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:03,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:03,457 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-22 02:34:03,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:03,465 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 13 treesize of output 17 [2022-11-22 02:34:03,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:03,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:03,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-11-22 02:34:04,240 INFO L321 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2022-11-22 02:34:04,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 61 [2022-11-22 02:34:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:34:04,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:34:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 02:34:04,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683937681] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:34:04,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [336101800] [2022-11-22 02:34:04,981 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 02:34:04,981 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:34:04,981 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:34:04,982 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:34:04,982 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:34:05,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:05,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:05,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2022-11-22 02:34:06,473 INFO L197 IcfgInterpreter]: Interpreting procedure get_dummy with input of size 77 for LOIs [2022-11-22 02:34:06,488 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:34:11,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [336101800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:34:11,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:34:11,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 8, 10] total 39 [2022-11-22 02:34:11,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055854337] [2022-11-22 02:34:11,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:34:11,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:34:11,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:34:11,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:34:11,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1283, Unknown=0, NotChecked=0, Total=1560 [2022-11-22 02:34:11,506 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 02:34:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:34:11,952 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-11-22 02:34:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 02:34:11,953 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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) Word has length 19 [2022-11-22 02:34:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:34:11,954 INFO L225 Difference]: With dead ends: 24 [2022-11-22 02:34:11,954 INFO L226 Difference]: Without dead ends: 22 [2022-11-22 02:34:11,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=277, Invalid=1283, Unknown=0, NotChecked=0, Total=1560 [2022-11-22 02:34:11,956 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:34:11,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 14 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:34:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-22 02:34:11,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-22 02:34:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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 02:34:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-11-22 02:34:11,969 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-11-22 02:34:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:34:11,970 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-11-22 02:34:11,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 02:34:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-11-22 02:34:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 02:34:11,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:34:11,971 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:34:11,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:34:12,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:34:12,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 02:34:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:34:12,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1269482009, now seen corresponding path program 1 times [2022-11-22 02:34:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:34:12,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347136025] [2022-11-22 02:34:12,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:34:12,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:34:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:34:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 02:34:12,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:34:12,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347136025] [2022-11-22 02:34:12,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347136025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:34:12,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467235988] [2022-11-22 02:34:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:34:12,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:34:12,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:34:13,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:34:13,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:34:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:34:13,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-22 02:34:13,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:34:13,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:13,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:13,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2022-11-22 02:34:13,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:34:13,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:34:13,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2022-11-22 02:34:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:34:13,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:34:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 02:34:14,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467235988] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:34:14,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [911272436] [2022-11-22 02:34:14,394 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-22 02:34:14,394 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:34:14,394 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:34:14,395 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:34:14,395 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:34:14,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:14,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:14,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2022-11-22 02:34:15,926 INFO L197 IcfgInterpreter]: Interpreting procedure get_dummy with input of size 77 for LOIs [2022-11-22 02:34:15,942 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:34:19,530 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '578#(and (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |~#d2~0.base|) (not (<= |ULTIMATE.start_main_~i~0#1| 2147483646)) (= |~#d1~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 02:34:19,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:34:19,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:34:19,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 11] total 32 [2022-11-22 02:34:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278428825] [2022-11-22 02:34:19,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:34:19,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 02:34:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:34:19,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 02:34:19,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1710, Unknown=0, NotChecked=0, Total=1980 [2022-11-22 02:34:19,539 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 33 states, 25 states have (on average 1.88) internal successors, (47), 28 states have internal predecessors, (47), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-22 02:34:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:34:20,739 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-11-22 02:34:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 02:34:20,742 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 1.88) internal successors, (47), 28 states have internal predecessors, (47), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 23 [2022-11-22 02:34:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:34:20,743 INFO L225 Difference]: With dead ends: 34 [2022-11-22 02:34:20,743 INFO L226 Difference]: Without dead ends: 33 [2022-11-22 02:34:20,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=464, Invalid=2506, Unknown=0, NotChecked=0, Total=2970 [2022-11-22 02:34:20,746 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 217 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:34:20,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 34 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:34:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-22 02:34:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-22 02:34:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 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 02:34:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-11-22 02:34:20,760 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2022-11-22 02:34:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:34:20,761 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-11-22 02:34:20,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 1.88) internal successors, (47), 28 states have internal predecessors, (47), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-22 02:34:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-11-22 02:34:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 02:34:20,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:34:20,762 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:34:20,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-22 02:34:20,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-22 02:34:20,968 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 02:34:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:34:20,969 INFO L85 PathProgramCache]: Analyzing trace with hash 699236684, now seen corresponding path program 1 times [2022-11-22 02:34:20,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:34:20,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120999313] [2022-11-22 02:34:20,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:34:20,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:34:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:34:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:34:21,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:34:21,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120999313] [2022-11-22 02:34:21,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120999313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:34:21,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:34:21,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:34:21,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287231130] [2022-11-22 02:34:21,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:34:21,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:34:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:34:21,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:34:21,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:34:21,025 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-22 02:34:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:34:21,057 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-11-22 02:34:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:34:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-11-22 02:34:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:34:21,060 INFO L225 Difference]: With dead ends: 33 [2022-11-22 02:34:21,060 INFO L226 Difference]: Without dead ends: 32 [2022-11-22 02:34:21,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:34:21,062 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:34:21,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 20 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:34:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-22 02:34:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-22 02:34:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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 02:34:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-11-22 02:34:21,091 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2022-11-22 02:34:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:34:21,091 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-11-22 02:34:21,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-22 02:34:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-11-22 02:34:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:34:21,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:34:21,094 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:34:21,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:34:21,095 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 02:34:21,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:34:21,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1473252356, now seen corresponding path program 2 times [2022-11-22 02:34:21,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:34:21,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279930387] [2022-11-22 02:34:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:34:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:34:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:34:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 02:34:21,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:34:21,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279930387] [2022-11-22 02:34:21,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279930387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:34:21,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536593391] [2022-11-22 02:34:21,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:34:21,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:34:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:34:21,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:34:21,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:34:22,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 02:34:22,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:34:22,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-22 02:34:22,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:34:22,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:22,049 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-22 02:34:22,056 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-22 02:34:22,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:22,062 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 13 treesize of output 17 [2022-11-22 02:34:22,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:22,071 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 13 treesize of output 17 [2022-11-22 02:34:23,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:34:23,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 41 [2022-11-22 02:34:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-22 02:34:23,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:34:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-22 02:34:23,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536593391] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:34:23,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1951422170] [2022-11-22 02:34:23,915 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-22 02:34:23,916 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:34:23,916 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:34:23,916 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:34:23,917 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:34:23,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:23,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:23,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2022-11-22 02:34:25,353 INFO L197 IcfgInterpreter]: Interpreting procedure get_dummy with input of size 77 for LOIs [2022-11-22 02:34:25,369 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:34:29,204 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1020#(and (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |~#d2~0.base|) (not (<= |ULTIMATE.start_main_~i~0#1| 2147483646)) (= |~#d1~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 02:34:29,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:34:29,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:34:29,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2022-11-22 02:34:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896379000] [2022-11-22 02:34:29,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:34:29,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 02:34:29,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:34:29,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 02:34:29,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1919, Unknown=0, NotChecked=0, Total=2256 [2022-11-22 02:34:29,207 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 35 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 29 states have internal predecessors, (55), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-22 02:34:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:34:30,220 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-11-22 02:34:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 02:34:30,222 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 29 states have internal predecessors, (55), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 35 [2022-11-22 02:34:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:34:30,223 INFO L225 Difference]: With dead ends: 32 [2022-11-22 02:34:30,223 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 02:34:30,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=483, Invalid=2379, Unknown=0, NotChecked=0, Total=2862 [2022-11-22 02:34:30,225 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 82 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:34:30,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 27 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:34:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 02:34:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 02:34:30,226 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 02:34:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 02:34:30,227 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-11-22 02:34:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:34:30,227 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 02:34:30,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 29 states have internal predecessors, (55), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-22 02:34:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 02:34:30,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 02:34:30,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-22 02:34:30,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-22 02:34:30,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-22 02:34:30,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-22 02:34:30,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:34:30,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:34:30,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 02:34:31,855 INFO L902 garLoopResultBuilder]: At program point get_dummyENTRY(lines 22 25) the Hoare annotation is: true [2022-11-22 02:34:31,856 INFO L899 garLoopResultBuilder]: For program point get_dummyEXIT(lines 22 25) no Hoare annotation was computed. [2022-11-22 02:34:31,856 INFO L895 garLoopResultBuilder]: At program point L35-2(line 35) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |~#d1~0.base|)) (.cse7 (select |#memory_int| |~#d2~0.base|))) (let ((.cse0 (select .cse7 |~#d2~0.offset|)) (.cse1 (select .cse6 |~#d1~0.offset|)) (.cse4 (select .cse7 (+ |~#d2~0.offset| 4))) (.cse3 (select .cse6 (+ |~#d1~0.offset| 4))) (.cse5 (select |#memory_int| 1))) (and (<= 0 (+ .cse0 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (<= .cse0 2147483647) (= 5 |~#d2~0.base|) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= .cse1 2147483647) (= (select |#valid| 3) 1) (exists ((|v_get_dummy_#t~nondet8_23| Int)) (let ((.cse2 (not (= (mod |v_get_dummy_#t~nondet8_23| 256) 0)))) (and (= (ite .cse2 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd1~0#1.base|) (= (ite .cse2 |~#d1~0.offset| |~#d2~0.offset|) |ULTIMATE.start_main_~pd1~0#1.offset|)))) (<= 0 (+ 2147483648 .cse1)) (= (select |#length| 4) 8) (<= 0 (+ .cse3 2147483648)) (= (select |#valid| 4) 1) (<= 0 (+ .cse4 2147483648)) (<= .cse4 2147483647) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 5)) (<= .cse3 2147483647) (= (select .cse5 0) 48) (= (select .cse5 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-22 02:34:31,856 INFO L899 garLoopResultBuilder]: For program point L35-3(line 35) no Hoare annotation was computed. [2022-11-22 02:34:31,857 INFO L895 garLoopResultBuilder]: At program point L35-4(line 35) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |~#d2~0.base|)) (.cse7 (select |#memory_int| |~#d1~0.base|))) (let ((.cse1 (select .cse7 |~#d1~0.offset|)) (.cse3 (select .cse0 (+ |~#d2~0.offset| 4))) (.cse2 (select .cse7 (+ |~#d1~0.offset| 4))) (.cse5 (select |#memory_int| 1))) (and (<= 0 (+ (select .cse0 |~#d2~0.offset|) 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |~#d2~0.base|) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= .cse1 2147483647) (= (select |#valid| 3) 1) (<= 0 (+ 2147483648 .cse1)) (= (select |#length| 4) 8) (<= (select (select |#memory_int| 5) 0) 2147483647) (<= 0 (+ .cse2 2147483648)) (= (select |#valid| 4) 1) (<= 0 (+ .cse3 2147483648)) (<= .cse3 2147483647) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (let ((.cse4 (= |ULTIMATE.start_main_~pd2~0#1.offset| 0))) (or (and .cse4 (= 5 |ULTIMATE.start_main_~pd2~0#1.base|)) (and .cse4 (= 4 |ULTIMATE.start_main_~pd2~0#1.base|)))) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 5)) (<= .cse2 2147483647) (= (select .cse5 0) 48) (= (select .cse5 1) 0) (let ((.cse6 (= |ULTIMATE.start_main_~pd1~0#1.offset| 0))) (or (and (= 4 |ULTIMATE.start_main_~pd1~0#1.base|) .cse6) (and (= 5 |ULTIMATE.start_main_~pd1~0#1.base|) .cse6))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-22 02:34:31,857 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-22 02:34:31,857 INFO L899 garLoopResultBuilder]: For program point L35-5(line 35) no Hoare annotation was computed. [2022-11-22 02:34:31,857 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2022-11-22 02:34:31,858 INFO L895 garLoopResultBuilder]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| 5) 0)) (.cse0 (select |#memory_int| |~#d2~0.base|)) (.cse13 (select |#memory_int| |~#d1~0.base|))) (let ((.cse1 (select .cse13 |~#d1~0.offset|)) (.cse2 (not |ULTIMATE.start_main_#t~short15#1|)) (.cse9 (select .cse0 (+ |~#d2~0.offset| 4))) (.cse8 (select .cse13 (+ |~#d1~0.offset| 4))) (.cse11 (select |#memory_int| 1)) (.cse6 (< 0 (select (select |#memory_int| 4) 0))) (.cse4 (< 0 .cse3)) (.cse7 (= 4 |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse5 (= 5 |ULTIMATE.start_main_~pd1~0#1.base|))) (and (<= 0 (+ (select .cse0 |~#d2~0.offset|) 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (= |ULTIMATE.start_main_~pa~0#1.offset| 0) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |~#d2~0.base|) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= .cse1 2147483647) (= (select |#valid| 3) 1) (or (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|) .cse2) (<= 0 (+ 2147483648 .cse1)) (= (select |#length| 4) 8) (<= .cse3 2147483647) (or (and .cse4 .cse5) (and .cse6 .cse7) .cse2) (<= 0 (+ .cse8 2147483648)) (= (select |#valid| 4) 1) (<= 0 (+ .cse9 2147483648)) (<= .cse9 2147483647) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (let ((.cse10 (= |ULTIMATE.start_main_~pd2~0#1.offset| 0))) (or (and .cse10 (= 5 |ULTIMATE.start_main_~pd2~0#1.base|)) (and .cse10 (= 4 |ULTIMATE.start_main_~pd2~0#1.base|)))) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 5)) (<= .cse8 2147483647) (= (select .cse11 0) 48) (= (select .cse11 1) 0) (or (and .cse6 (= |ULTIMATE.start_main_~pa~0#1.base| 4)) (and .cse4 (= 5 |ULTIMATE.start_main_~pa~0#1.base|))) (let ((.cse12 (= |ULTIMATE.start_main_~pd1~0#1.offset| 0))) (or (and .cse7 .cse12) (and .cse5 .cse12))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-22 02:34:31,858 INFO L895 garLoopResultBuilder]: At program point L40-4(lines 40 42) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |~#d1~0.base|)) (.cse8 (select |#memory_int| |~#d2~0.base|))) (let ((.cse0 (select .cse8 |~#d2~0.offset|)) (.cse3 (select .cse7 |~#d1~0.offset|)) (.cse5 (select .cse8 (+ |~#d2~0.offset| 4))) (.cse4 (select .cse7 (+ |~#d1~0.offset| 4))) (.cse6 (select |#memory_int| 1))) (and (<= 0 (+ .cse0 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (exists ((|v_get_dummy_#t~nondet8_15| Int)) (let ((.cse1 (not (= (mod |v_get_dummy_#t~nondet8_15| 256) 0)))) (and (= |ULTIMATE.start_main_~pd2~0#1.offset| (ite .cse1 |~#d1~0.offset| |~#d2~0.offset|)) (= (ite .cse1 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd2~0#1.base|)))) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (<= .cse0 2147483647) (= 5 |~#d2~0.base|) (exists ((|v_get_dummy_#t~nondet8_13| Int)) (let ((.cse2 (not (= (mod |v_get_dummy_#t~nondet8_13| 256) 0)))) (and (= (ite .cse2 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd1~0#1.base|) (= (ite .cse2 |~#d1~0.offset| |~#d2~0.offset|) |ULTIMATE.start_main_~pd1~0#1.offset|)))) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= .cse3 2147483647) (= (select |#valid| 3) 1) (<= 0 (+ 2147483648 .cse3)) (= (select |#length| 4) 8) (<= 0 (+ .cse4 2147483648)) (= (select |#valid| 4) 1) (<= 0 (+ .cse5 2147483648)) (<= .cse5 2147483647) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 5)) (<= .cse4 2147483647) (= (select .cse6 0) 48) (= (select .cse6 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-22 02:34:31,858 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-22 02:34:31,859 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 02:34:31,859 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-11-22 02:34:31,859 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-11-22 02:34:31,859 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 37 46) no Hoare annotation was computed. [2022-11-22 02:34:31,859 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-22 02:34:31,859 INFO L899 garLoopResultBuilder]: For program point L37-4(lines 37 46) no Hoare annotation was computed. [2022-11-22 02:34:31,860 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 02:34:31,860 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-22 02:34:31,860 INFO L895 garLoopResultBuilder]: At program point L51(lines 32 52) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |~#d1~0.base|)) (.cse8 (select |#memory_int| |~#d2~0.base|))) (let ((.cse0 (select .cse8 |~#d2~0.offset|)) (.cse3 (select .cse7 |~#d1~0.offset|)) (.cse5 (select .cse8 (+ |~#d2~0.offset| 4))) (.cse4 (select .cse7 (+ |~#d1~0.offset| 4))) (.cse6 (select |#memory_int| 1))) (and (<= 0 (+ .cse0 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (exists ((|v_get_dummy_#t~nondet8_15| Int)) (let ((.cse1 (not (= (mod |v_get_dummy_#t~nondet8_15| 256) 0)))) (and (= |ULTIMATE.start_main_~pd2~0#1.offset| (ite .cse1 |~#d1~0.offset| |~#d2~0.offset|)) (= (ite .cse1 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd2~0#1.base|)))) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (<= .cse0 2147483647) (= 5 |~#d2~0.base|) (exists ((|v_get_dummy_#t~nondet8_13| Int)) (let ((.cse2 (not (= (mod |v_get_dummy_#t~nondet8_13| 256) 0)))) (and (= (ite .cse2 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd1~0#1.base|) (= (ite .cse2 |~#d1~0.offset| |~#d2~0.offset|) |ULTIMATE.start_main_~pd1~0#1.offset|)))) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= .cse3 2147483647) (= (select |#valid| 3) 1) (<= 0 (+ 2147483648 .cse3)) (= (select |#length| 4) 8) (<= 0 (+ .cse4 2147483648)) (= (select |#valid| 4) 1) (<= 0 (+ .cse5 2147483648)) (<= .cse5 2147483647) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 5)) (<= .cse4 2147483647) (= (select .cse6 0) 48) (= (select .cse6 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-22 02:34:31,861 INFO L895 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |~#d1~0.base|)) (.cse8 (select |#memory_int| |~#d2~0.base|))) (let ((.cse0 (select .cse8 |~#d2~0.offset|)) (.cse3 (select .cse7 |~#d1~0.offset|)) (.cse5 (select .cse8 (+ |~#d2~0.offset| 4))) (.cse4 (select .cse7 (+ |~#d1~0.offset| 4))) (.cse6 (select |#memory_int| 1))) (and (<= 0 (+ .cse0 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (exists ((|v_get_dummy_#t~nondet8_15| Int)) (let ((.cse1 (not (= (mod |v_get_dummy_#t~nondet8_15| 256) 0)))) (and (= |ULTIMATE.start_main_~pd2~0#1.offset| (ite .cse1 |~#d1~0.offset| |~#d2~0.offset|)) (= (ite .cse1 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd2~0#1.base|)))) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (<= .cse0 2147483647) (= 5 |~#d2~0.base|) (exists ((|v_get_dummy_#t~nondet8_13| Int)) (let ((.cse2 (not (= (mod |v_get_dummy_#t~nondet8_13| 256) 0)))) (and (= (ite .cse2 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd1~0#1.base|) (= (ite .cse2 |~#d1~0.offset| |~#d2~0.offset|) |ULTIMATE.start_main_~pd1~0#1.offset|)))) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= .cse3 2147483647) (= (select |#valid| 3) 1) (<= 0 (+ 2147483648 .cse3)) (= (select |#length| 4) 8) (<= 0 (+ .cse4 2147483648)) (= (select |#valid| 4) 1) (<= 0 (+ .cse5 2147483648)) (<= .cse5 2147483647) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 5)) (<= .cse4 2147483647) (= (select .cse6 0) 48) (= (select .cse6 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-22 02:34:31,861 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-11-22 02:34:31,861 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-11-22 02:34:31,861 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |~#d1~0.base|)) (.cse6 (select |#memory_int| |~#d2~0.base|))) (let ((.cse0 (select .cse6 |~#d2~0.offset|)) (.cse1 (select .cse5 |~#d1~0.offset|)) (.cse3 (select .cse6 (+ |~#d2~0.offset| 4))) (.cse2 (select .cse5 (+ |~#d1~0.offset| 4))) (.cse4 (select |#memory_int| 1))) (and (<= 0 (+ .cse0 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (<= .cse0 2147483647) (= 5 |~#d2~0.base|) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= .cse1 2147483647) (= (select |#valid| 3) 1) (<= 0 (+ 2147483648 .cse1)) (= (select |#length| 4) 8) (<= 0 (+ .cse2 2147483648)) (= (select |#valid| 4) 1) (<= 0 (+ .cse3 2147483648)) (<= .cse3 2147483647) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 5)) (<= .cse2 2147483647) (= (select .cse4 0) 48) (= (select .cse4 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-22 02:34:31,861 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2022-11-22 02:34:31,865 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-11-22 02:34:31,867 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:34:31,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,889 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,889 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,890 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,897 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,899 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,899 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,900 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,901 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,902 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,902 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,903 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,904 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,905 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,905 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,905 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,907 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,907 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,908 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,908 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:34:31 BoogieIcfgContainer [2022-11-22 02:34:31,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:34:31,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:34:31,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:34:31,911 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:34:31,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:33:53" (3/4) ... [2022-11-22 02:34:31,914 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 02:34:31,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2022-11-22 02:34:31,925 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-22 02:34:31,925 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-22 02:34:31,925 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 02:34:31,926 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 02:34:31,951 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[d2][d2] + 2147483648 && 1 == \valid[5]) && unknown-#length-unknown[3] == 12) && (\exists v_get_dummy_#t~nondet8_15 : int :: pd2 == (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) && (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) == pd2)) && d2 == 0) && d1 == 4) && unknown-#memory_int-unknown[d2][d2] <= 2147483647) && 5 == d2) && (\exists v_get_dummy_#t~nondet8_13 : int :: (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1 && (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1)) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && unknown-#memory_int-unknown[d1][d1] <= 2147483647) && \valid[3] == 1) && 0 <= 2147483648 + unknown-#memory_int-unknown[d1][d1]) && unknown-#length-unknown[4] == 8) && 0 <= unknown-#memory_int-unknown[d1][d1 + 4] + 2147483648) && \valid[4] == 1) && 0 <= unknown-#memory_int-unknown[d2][d2 + 4] + 2147483648) && unknown-#memory_int-unknown[d2][d2 + 4] <= 2147483647) && \valid[1] == 1) && \valid[0] == 0) && d1 == 0) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[5]) && unknown-#memory_int-unknown[d1][d1 + 4] <= 2147483647) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 [2022-11-22 02:34:31,952 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[d2][d2] + 2147483648 && 1 == \valid[5]) && unknown-#length-unknown[3] == 12) && (\exists v_get_dummy_#t~nondet8_15 : int :: pd2 == (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) && (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) == pd2)) && d2 == 0) && d1 == 4) && unknown-#memory_int-unknown[d2][d2] <= 2147483647) && 5 == d2) && (\exists v_get_dummy_#t~nondet8_13 : int :: (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1 && (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1)) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && unknown-#memory_int-unknown[d1][d1] <= 2147483647) && \valid[3] == 1) && 0 <= 2147483648 + unknown-#memory_int-unknown[d1][d1]) && unknown-#length-unknown[4] == 8) && 0 <= unknown-#memory_int-unknown[d1][d1 + 4] + 2147483648) && \valid[4] == 1) && 0 <= unknown-#memory_int-unknown[d2][d2 + 4] + 2147483648) && unknown-#memory_int-unknown[d2][d2 + 4] <= 2147483647) && \valid[1] == 1) && \valid[0] == 0) && d1 == 0) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[5]) && unknown-#memory_int-unknown[d1][d1 + 4] <= 2147483647) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 [2022-11-22 02:34:31,952 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[d2][d2] + 2147483648 && 1 == \valid[5]) && unknown-#length-unknown[3] == 12) && (\exists v_get_dummy_#t~nondet8_15 : int :: pd2 == (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) && (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) == pd2)) && d2 == 0) && d1 == 4) && unknown-#memory_int-unknown[d2][d2] <= 2147483647) && 5 == d2) && (\exists v_get_dummy_#t~nondet8_13 : int :: (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1 && (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1)) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && unknown-#memory_int-unknown[d1][d1] <= 2147483647) && \valid[3] == 1) && 0 <= 2147483648 + unknown-#memory_int-unknown[d1][d1]) && unknown-#length-unknown[4] == 8) && 0 <= unknown-#memory_int-unknown[d1][d1 + 4] + 2147483648) && \valid[4] == 1) && 0 <= unknown-#memory_int-unknown[d2][d2 + 4] + 2147483648) && unknown-#memory_int-unknown[d2][d2 + 4] <= 2147483647) && \valid[1] == 1) && \valid[0] == 0) && d1 == 0) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[5]) && unknown-#memory_int-unknown[d1][d1 + 4] <= 2147483647) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 [2022-11-22 02:34:31,966 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:34:31,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:34:31,967 INFO L158 Benchmark]: Toolchain (without parser) took 38808.69ms. Allocated memory was 176.2MB in the beginning and 446.7MB in the end (delta: 270.5MB). Free memory was 143.9MB in the beginning and 347.8MB in the end (delta: -203.9MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2022-11-22 02:34:31,968 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 132.1MB. Free memory was 98.0MB in the beginning and 98.0MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:34:31,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.46ms. Allocated memory is still 176.2MB. Free memory was 143.9MB in the beginning and 133.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-22 02:34:31,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.91ms. Allocated memory is still 176.2MB. Free memory was 133.3MB in the beginning and 131.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:34:31,968 INFO L158 Benchmark]: Boogie Preprocessor took 27.86ms. Allocated memory is still 176.2MB. Free memory was 131.5MB in the beginning and 130.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:34:31,971 INFO L158 Benchmark]: RCFGBuilder took 369.06ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 114.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-22 02:34:31,972 INFO L158 Benchmark]: TraceAbstraction took 38075.13ms. Allocated memory was 176.2MB in the beginning and 446.7MB in the end (delta: 270.5MB). Free memory was 114.3MB in the beginning and 350.9MB in the end (delta: -236.6MB). Peak memory consumption was 238.4MB. Max. memory is 16.1GB. [2022-11-22 02:34:31,973 INFO L158 Benchmark]: Witness Printer took 56.35ms. Allocated memory is still 446.7MB. Free memory was 350.9MB in the beginning and 347.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:34:31,977 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 132.1MB. Free memory was 98.0MB in the beginning and 98.0MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.46ms. Allocated memory is still 176.2MB. Free memory was 143.9MB in the beginning and 133.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.91ms. Allocated memory is still 176.2MB. Free memory was 133.3MB in the beginning and 131.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.86ms. Allocated memory is still 176.2MB. Free memory was 131.5MB in the beginning and 130.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.06ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 114.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38075.13ms. Allocated memory was 176.2MB in the beginning and 446.7MB in the end (delta: 270.5MB). Free memory was 114.3MB in the beginning and 350.9MB in the end (delta: -236.6MB). Peak memory consumption was 238.4MB. Max. memory is 16.1GB. * Witness Printer took 56.35ms. Allocated memory is still 446.7MB. Free memory was 350.9MB in the beginning and 347.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] * 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: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: 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, 25 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 38.0s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 359 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 707 IncrementalHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 41 mSDtfsCounter, 707 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 157 SyntacticMatches, 9 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=3, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 1432 HoareAnnotationTreeSize, 10 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 2176 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 208 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 287 ConstructedInterpolants, 6 QuantifiedInterpolants, 4842 SizeOfPredicates, 57 NumberOfNonLiveVariables, 570 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 110/199 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: 2.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 30, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 20, TOOLS_POST_TIME: 1.6s, TOOLS_POST_CALL_APPLICATIONS: 18, TOOLS_POST_CALL_TIME: 0.2s, TOOLS_POST_RETURN_APPLICATIONS: 12, TOOLS_POST_RETURN_TIME: 0.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 50, TOOLS_QUANTIFIERELIM_TIME: 2.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 74, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 16, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 30, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 12, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 320, DAG_COMPRESSION_RETAINED_NODES: 80, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[d2][d2] + 2147483648 && 1 == \valid[5]) && unknown-#length-unknown[3] == 12) && pa == 0) && d2 == 0) && d1 == 4) && 5 == d2) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && 0 <= i + 2147483648) && unknown-#memory_int-unknown[d1][d1] <= 2147483647) && \valid[3] == 1) && (pd2 == pd1 || !aux-pd1 != 0 && pd1 == pd2 && (*pd2).a > 0-aux)) && 0 <= 2147483648 + unknown-#memory_int-unknown[d1][d1]) && unknown-#length-unknown[4] == 8) && unknown-#memory_int-unknown[5][0] <= 2147483647) && (((0 < unknown-#memory_int-unknown[5][0] && 5 == pd1) || (0 < unknown-#memory_int-unknown[4][0] && 4 == pd1)) || !aux-pd1 != 0 && pd1 == pd2 && (*pd2).a > 0-aux)) && 0 <= unknown-#memory_int-unknown[d1][d1 + 4] + 2147483648) && \valid[4] == 1) && 0 <= unknown-#memory_int-unknown[d2][d2 + 4] + 2147483648) && unknown-#memory_int-unknown[d2][d2 + 4] <= 2147483647) && \valid[1] == 1) && \valid[0] == 0) && d1 == 0) && ((pd2 == 0 && 5 == pd2) || (pd2 == 0 && 4 == pd2))) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[5]) && unknown-#memory_int-unknown[d1][d1 + 4] <= 2147483647) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && ((0 < unknown-#memory_int-unknown[4][0] && pa == 4) || (0 < unknown-#memory_int-unknown[5][0] && 5 == pa))) && ((4 == pd1 && pd1 == 0) || (5 == pd1 && pd1 == 0))) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 32]: Loop Invariant [2022-11-22 02:34:31,998 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,998 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:31,999 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:31,999 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:32,000 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:32,000 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:32,000 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:32,001 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[d2][d2] + 2147483648 && 1 == \valid[5]) && unknown-#length-unknown[3] == 12) && (\exists v_get_dummy_#t~nondet8_15 : int :: pd2 == (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) && (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) == pd2)) && d2 == 0) && d1 == 4) && unknown-#memory_int-unknown[d2][d2] <= 2147483647) && 5 == d2) && (\exists v_get_dummy_#t~nondet8_13 : int :: (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1 && (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1)) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && unknown-#memory_int-unknown[d1][d1] <= 2147483647) && \valid[3] == 1) && 0 <= 2147483648 + unknown-#memory_int-unknown[d1][d1]) && unknown-#length-unknown[4] == 8) && 0 <= unknown-#memory_int-unknown[d1][d1 + 4] + 2147483648) && \valid[4] == 1) && 0 <= unknown-#memory_int-unknown[d2][d2 + 4] + 2147483648) && unknown-#memory_int-unknown[d2][d2 + 4] <= 2147483647) && \valid[1] == 1) && \valid[0] == 0) && d1 == 0) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[5]) && unknown-#memory_int-unknown[d1][d1 + 4] <= 2147483647) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 43]: Loop Invariant [2022-11-22 02:34:32,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:32,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:32,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:32,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:32,003 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:32,004 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:32,004 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:32,004 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[d2][d2] + 2147483648 && 1 == \valid[5]) && unknown-#length-unknown[3] == 12) && (\exists v_get_dummy_#t~nondet8_15 : int :: pd2 == (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) && (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) == pd2)) && d2 == 0) && d1 == 4) && unknown-#memory_int-unknown[d2][d2] <= 2147483647) && 5 == d2) && (\exists v_get_dummy_#t~nondet8_13 : int :: (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1 && (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1)) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && unknown-#memory_int-unknown[d1][d1] <= 2147483647) && \valid[3] == 1) && 0 <= 2147483648 + unknown-#memory_int-unknown[d1][d1]) && unknown-#length-unknown[4] == 8) && 0 <= unknown-#memory_int-unknown[d1][d1 + 4] + 2147483648) && \valid[4] == 1) && 0 <= unknown-#memory_int-unknown[d2][d2 + 4] + 2147483648) && unknown-#memory_int-unknown[d2][d2 + 4] <= 2147483647) && \valid[1] == 1) && \valid[0] == 0) && d1 == 0) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[5]) && unknown-#memory_int-unknown[d1][d1 + 4] <= 2147483647) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 40]: Loop Invariant [2022-11-22 02:34:32,005 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:32,006 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:32,006 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:32,006 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:32,010 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:32,012 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_15,QUANTIFIED] [2022-11-22 02:34:32,012 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] [2022-11-22 02:34:32,013 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_13,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[d2][d2] + 2147483648 && 1 == \valid[5]) && unknown-#length-unknown[3] == 12) && (\exists v_get_dummy_#t~nondet8_15 : int :: pd2 == (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) && (if !(v_get_dummy_#t~nondet8_15 % 256 == 0) then d1 else d2) == pd2)) && d2 == 0) && d1 == 4) && unknown-#memory_int-unknown[d2][d2] <= 2147483647) && 5 == d2) && (\exists v_get_dummy_#t~nondet8_13 : int :: (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1 && (if !(v_get_dummy_#t~nondet8_13 % 256 == 0) then d1 else d2) == pd1)) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && unknown-#memory_int-unknown[d1][d1] <= 2147483647) && \valid[3] == 1) && 0 <= 2147483648 + unknown-#memory_int-unknown[d1][d1]) && unknown-#length-unknown[4] == 8) && 0 <= unknown-#memory_int-unknown[d1][d1 + 4] + 2147483648) && \valid[4] == 1) && 0 <= unknown-#memory_int-unknown[d2][d2 + 4] + 2147483648) && unknown-#memory_int-unknown[d2][d2 + 4] <= 2147483647) && \valid[1] == 1) && \valid[0] == 0) && d1 == 0) && \valid[2] == 1) && #NULL == 0) && 8 == unknown-#length-unknown[5]) && unknown-#memory_int-unknown[d1][d1 + 4] <= 2147483647) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 RESULT: Ultimate proved your program to be correct! [2022-11-22 02:34:32,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_439e1d5e-e0e8-48de-969c-6b63efa0070c/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