./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7 --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 db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:22:24,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:22:24,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:22:24,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:22:24,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:22:24,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:22:24,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:22:24,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:22:24,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:22:24,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:22:24,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:22:24,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:22:24,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:22:24,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:22:24,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:22:24,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:22:24,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:22:24,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:22:24,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:22:24,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:22:24,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:22:24,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:22:24,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:22:24,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:22:24,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:22:24,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:22:24,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:22:24,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:22:24,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:22:24,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:22:24,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:22:24,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:22:24,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:22:24,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:22:24,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:22:24,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:22:24,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:22:24,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:22:24,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:22:24,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:22:24,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:22:24,377 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/config/svcomp-Overflow-32bit-Taipan_Default.epf [2021-11-25 18:22:24,407 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:22:24,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:22:24,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:22:24,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:22:24,409 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:22:24,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:22:24,410 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:22:24,410 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:22:24,411 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:22:24,411 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:22:24,411 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:22:24,412 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:22:24,412 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:22:24,413 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:22:24,413 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:22:24,413 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:22:24,414 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:22:24,414 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:22:24,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:22:24,415 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:22:24,416 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 18:22:24,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:22:24,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:22:24,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:22:24,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 18:22:24,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:22:24,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 18:22:24,418 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-25 18:22:24,419 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:22:24,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 18:22:24,420 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:22:24,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 18:22:24,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:22:24,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:22:24,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:22:24,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:22:24,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:22:24,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 18:22:24,422 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:22:24,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:22:24,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 18:22:24,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:22:24,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:22:24,423 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/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_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7 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 -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2021-11-25 18:22:24,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:22:24,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:22:24,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:22:24,815 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:22:24,816 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:22:24,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/bitvector/byte_add_1-2.i [2021-11-25 18:22:24,906 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/data/0b65af5eb/069f9ff22c644816b8bc8208cff44921/FLAG81905579f [2021-11-25 18:22:25,462 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:22:25,464 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/sv-benchmarks/c/bitvector/byte_add_1-2.i [2021-11-25 18:22:25,484 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/data/0b65af5eb/069f9ff22c644816b8bc8208cff44921/FLAG81905579f [2021-11-25 18:22:25,776 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/data/0b65af5eb/069f9ff22c644816b8bc8208cff44921 [2021-11-25 18:22:25,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:22:25,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:22:25,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:22:25,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:22:25,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:22:25,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:22:25" (1/1) ... [2021-11-25 18:22:25,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e4aa0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:25, skipping insertion in model container [2021-11-25 18:22:25,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:22:25" (1/1) ... [2021-11-25 18:22:25,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:22:25,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:22:26,057 WARN L230 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_6b07dc61-fdff-44d7-ba07-a06882450a7d/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2021-11-25 18:22:26,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:22:26,147 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:22:26,167 WARN L230 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_6b07dc61-fdff-44d7-ba07-a06882450a7d/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2021-11-25 18:22:26,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:22:26,225 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:22:26,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26 WrapperNode [2021-11-25 18:22:26,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:22:26,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:22:26,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:22:26,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:22:26,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (1/1) ... [2021-11-25 18:22:26,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (1/1) ... [2021-11-25 18:22:26,291 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2021-11-25 18:22:26,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:22:26,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:22:26,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:22:26,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:22:26,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (1/1) ... [2021-11-25 18:22:26,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (1/1) ... [2021-11-25 18:22:26,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (1/1) ... [2021-11-25 18:22:26,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (1/1) ... [2021-11-25 18:22:26,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (1/1) ... [2021-11-25 18:22:26,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (1/1) ... [2021-11-25 18:22:26,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (1/1) ... [2021-11-25 18:22:26,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:22:26,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:22:26,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:22:26,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:22:26,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (1/1) ... [2021-11-25 18:22:26,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:22:26,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:22:26,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:22:26,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:22:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:22:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:22:26,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:22:26,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:22:26,472 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:22:26,473 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:22:26,750 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:22:26,833 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:22:26,833 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-25 18:22:26,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:26 BoogieIcfgContainer [2021-11-25 18:22:26,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:22:26,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:22:26,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:22:26,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:22:26,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:22:25" (1/3) ... [2021-11-25 18:22:26,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:22:26, skipping insertion in model container [2021-11-25 18:22:26,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:26" (2/3) ... [2021-11-25 18:22:26,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:22:26, skipping insertion in model container [2021-11-25 18:22:26,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:26" (3/3) ... [2021-11-25 18:22:26,845 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2021-11-25 18:22:26,850 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:22:26,850 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-11-25 18:22:26,925 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:22:26,933 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:22:26,934 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-11-25 18:22:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 98 states have internal predecessors, (116), 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) [2021-11-25 18:22:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-25 18:22:26,961 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:26,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-25 18:22:26,963 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:26,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash 290383, now seen corresponding path program 1 times [2021-11-25 18:22:26,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:26,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944795148] [2021-11-25 18:22:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:26,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:27,175 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:27,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944795148] [2021-11-25 18:22:27,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944795148] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:22:27,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:22:27,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-25 18:22:27,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545745058] [2021-11-25 18:22:27,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:22:27,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 18:22:27,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:27,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 18:22:27,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:22:27,234 INFO L87 Difference]: Start difference. First operand has 99 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 98 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:22:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:27,291 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2021-11-25 18:22:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 18:22:27,294 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-25 18:22:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:27,316 INFO L225 Difference]: With dead ends: 99 [2021-11-25 18:22:27,316 INFO L226 Difference]: Without dead ends: 60 [2021-11-25 18:22:27,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:22:27,324 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:27,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:22:27,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-25 18:22:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-25 18:22:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.305084745762712) internal successors, (77), 59 states have internal predecessors, (77), 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) [2021-11-25 18:22:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2021-11-25 18:22:27,362 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 3 [2021-11-25 18:22:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:27,362 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2021-11-25 18:22:27,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:22:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2021-11-25 18:22:27,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-25 18:22:27,364 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:27,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:27,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:22:27,365 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:27,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash 862708226, now seen corresponding path program 1 times [2021-11-25 18:22:27,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:27,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204848116] [2021-11-25 18:22:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:27,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:27,555 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:27,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204848116] [2021-11-25 18:22:27,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204848116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:22:27,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:22:27,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:22:27,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968494649] [2021-11-25 18:22:27,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:22:27,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:22:27,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:27,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:22:27,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:22:27,560 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-11-25 18:22:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:27,697 INFO L93 Difference]: Finished difference Result 120 states and 160 transitions. [2021-11-25 18:22:27,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:22:27,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-25 18:22:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:27,699 INFO L225 Difference]: With dead ends: 120 [2021-11-25 18:22:27,700 INFO L226 Difference]: Without dead ends: 81 [2021-11-25 18:22:27,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:22:27,702 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:27,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 105 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:22:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-25 18:22:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2021-11-25 18:22:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 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) [2021-11-25 18:22:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2021-11-25 18:22:27,714 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 12 [2021-11-25 18:22:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:27,714 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2021-11-25 18:22:27,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-11-25 18:22:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2021-11-25 18:22:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:22:27,716 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:27,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:27,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 18:22:27,717 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:27,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1303120393, now seen corresponding path program 1 times [2021-11-25 18:22:27,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:27,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247245629] [2021-11-25 18:22:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:27,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:27,871 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:27,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247245629] [2021-11-25 18:22:27,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247245629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:22:27,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:22:27,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:22:27,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663225933] [2021-11-25 18:22:27,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:22:27,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:22:27,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:27,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:22:27,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:22:27,874 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-11-25 18:22:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:28,165 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2021-11-25 18:22:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:22:28,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 18:22:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:28,172 INFO L225 Difference]: With dead ends: 111 [2021-11-25 18:22:28,173 INFO L226 Difference]: Without dead ends: 99 [2021-11-25 18:22:28,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:22:28,183 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 86 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:28,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 226 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:22:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-25 18:22:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2021-11-25 18:22:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 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) [2021-11-25 18:22:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2021-11-25 18:22:28,206 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 15 [2021-11-25 18:22:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:28,207 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2021-11-25 18:22:28,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-11-25 18:22:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2021-11-25 18:22:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:22:28,209 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:28,210 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:28,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 18:22:28,211 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash 521913395, now seen corresponding path program 1 times [2021-11-25 18:22:28,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:28,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030488610] [2021-11-25 18:22:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:28,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:28,361 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:28,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030488610] [2021-11-25 18:22:28,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030488610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:22:28,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:22:28,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 18:22:28,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474512801] [2021-11-25 18:22:28,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:22:28,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:22:28,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:28,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:22:28,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:22:28,366 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:22:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:28,532 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2021-11-25 18:22:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:22:28,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-25 18:22:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:28,534 INFO L225 Difference]: With dead ends: 118 [2021-11-25 18:22:28,534 INFO L226 Difference]: Without dead ends: 81 [2021-11-25 18:22:28,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:22:28,544 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 79 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:28,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 138 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:22:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-25 18:22:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2021-11-25 18:22:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 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) [2021-11-25 18:22:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2021-11-25 18:22:28,564 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 18 [2021-11-25 18:22:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:28,564 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2021-11-25 18:22:28,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:22:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2021-11-25 18:22:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:22:28,590 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:28,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:28,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 18:22:28,592 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1891165951, now seen corresponding path program 1 times [2021-11-25 18:22:28,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:28,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240988060] [2021-11-25 18:22:28,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:28,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:28,783 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:28,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240988060] [2021-11-25 18:22:28,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240988060] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:22:28,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:22:28,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:22:28,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668969817] [2021-11-25 18:22:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:22:28,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:22:28,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:28,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:22:28,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:22:28,789 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2021-11-25 18:22:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:28,969 INFO L93 Difference]: Finished difference Result 156 states and 211 transitions. [2021-11-25 18:22:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:22:28,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 18:22:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:28,972 INFO L225 Difference]: With dead ends: 156 [2021-11-25 18:22:28,972 INFO L226 Difference]: Without dead ends: 118 [2021-11-25 18:22:28,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:22:28,976 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:28,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 143 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:22:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-25 18:22:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2021-11-25 18:22:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 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) [2021-11-25 18:22:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2021-11-25 18:22:29,006 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 24 [2021-11-25 18:22:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:29,006 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2021-11-25 18:22:29,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2021-11-25 18:22:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2021-11-25 18:22:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 18:22:29,016 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:29,016 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:29,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 18:22:29,017 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:29,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash 747339762, now seen corresponding path program 1 times [2021-11-25 18:22:29,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:29,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645835687] [2021-11-25 18:22:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:29,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:22:29,254 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:29,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645835687] [2021-11-25 18:22:29,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645835687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:22:29,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:22:29,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:22:29,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361778703] [2021-11-25 18:22:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:22:29,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:22:29,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:29,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:22:29,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:22:29,259 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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) [2021-11-25 18:22:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:29,393 INFO L93 Difference]: Finished difference Result 244 states and 307 transitions. [2021-11-25 18:22:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:22:29,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 18:22:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:29,396 INFO L225 Difference]: With dead ends: 244 [2021-11-25 18:22:29,396 INFO L226 Difference]: Without dead ends: 180 [2021-11-25 18:22:29,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:22:29,400 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:29,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 173 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:22:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-25 18:22:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 101. [2021-11-25 18:22:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.28) internal successors, (128), 100 states have internal predecessors, (128), 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) [2021-11-25 18:22:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2021-11-25 18:22:29,427 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 30 [2021-11-25 18:22:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:29,427 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2021-11-25 18:22:29,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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) [2021-11-25 18:22:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2021-11-25 18:22:29,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 18:22:29,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:29,433 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:29,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 18:22:29,434 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:29,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1296784938, now seen corresponding path program 1 times [2021-11-25 18:22:29,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:29,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694319277] [2021-11-25 18:22:29,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:29,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 18:22:29,650 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:29,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694319277] [2021-11-25 18:22:29,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694319277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:22:29,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:22:29,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:22:29,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944036009] [2021-11-25 18:22:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:22:29,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:22:29,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:29,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:22:29,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:22:29,653 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2021-11-25 18:22:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:29,777 INFO L93 Difference]: Finished difference Result 250 states and 313 transitions. [2021-11-25 18:22:29,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:22:29,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 18:22:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:29,779 INFO L225 Difference]: With dead ends: 250 [2021-11-25 18:22:29,779 INFO L226 Difference]: Without dead ends: 187 [2021-11-25 18:22:29,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:22:29,781 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 78 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:29,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 164 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:22:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-25 18:22:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 113. [2021-11-25 18:22:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 112 states have internal predecessors, (141), 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) [2021-11-25 18:22:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 141 transitions. [2021-11-25 18:22:29,795 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 141 transitions. Word has length 30 [2021-11-25 18:22:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:29,795 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 141 transitions. [2021-11-25 18:22:29,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2021-11-25 18:22:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2021-11-25 18:22:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 18:22:29,800 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:29,801 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:29,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 18:22:29,801 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:29,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:29,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1698043964, now seen corresponding path program 1 times [2021-11-25 18:22:29,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:29,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382132407] [2021-11-25 18:22:29,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:29,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-25 18:22:29,905 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:29,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382132407] [2021-11-25 18:22:29,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382132407] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:22:29,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:22:29,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:22:29,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701425136] [2021-11-25 18:22:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:22:29,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:22:29,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:29,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:22:29,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:22:29,908 INFO L87 Difference]: Start difference. First operand 113 states and 141 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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) [2021-11-25 18:22:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:29,922 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2021-11-25 18:22:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:22:29,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-25 18:22:29,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:29,924 INFO L225 Difference]: With dead ends: 184 [2021-11-25 18:22:29,924 INFO L226 Difference]: Without dead ends: 89 [2021-11-25 18:22:29,924 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:22:29,925 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:29,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:22:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-25 18:22:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-25 18:22:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 88 states have internal predecessors, (109), 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) [2021-11-25 18:22:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2021-11-25 18:22:29,931 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 33 [2021-11-25 18:22:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:29,931 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2021-11-25 18:22:29,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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) [2021-11-25 18:22:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2021-11-25 18:22:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 18:22:29,932 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:29,932 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:29,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 18:22:29,933 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:29,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:29,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1365842675, now seen corresponding path program 1 times [2021-11-25 18:22:29,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:29,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154873293] [2021-11-25 18:22:29,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:29,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:30,063 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:30,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154873293] [2021-11-25 18:22:30,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154873293] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:22:30,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603659103] [2021-11-25 18:22:30,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:30,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:22:30,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:22:30,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:22:30,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:22:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:30,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 18:22:30,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:22:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:22:30,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:22:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:22:31,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603659103] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:22:31,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1473703285] [2021-11-25 18:22:31,158 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-11-25 18:22:31,159 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:22:31,164 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:22:31,170 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:22:31,170 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:22:37,982 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:22:40,852 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2376#(and (<= |ULTIMATE.start_mp_add_~carry~0#1| 1) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_mp_add_~i~0#1| 257) (<= |ULTIMATE.start_mp_add_~a0~0#1| 234770789) (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 234770789 |ULTIMATE.start_mp_add_~a#1|) (= (mod |ULTIMATE.start_mp_add_~carry~0#1| 65536) 0) (<= |ULTIMATE.start_main_~a~0#1| 234770789) (<= |ULTIMATE.start_mp_add_~nb~0#1| 3) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= 234770789 |ULTIMATE.start_mp_add_~a0~0#1|) (<= 3 |ULTIMATE.start_mp_add_~nb~0#1|) (<= 0 |ULTIMATE.start_mp_add_~i~0#1|) (<= |#NULL.offset| 0) (<= 234770789 |ULTIMATE.start_mp_add_#in~a#1|) (<= |ULTIMATE.start_mp_add_#in~a#1| 234770789) (<= |#NULL.base| 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) (mod |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 0 |ULTIMATE.start_mp_add_~carry~0#1|) (<= |ULTIMATE.start_mp_add_~a#1| 234770789) (<= 0 |#NULL.offset|) (<= 234770789 |ULTIMATE.start_main_~a~0#1|) (<= 0 |#StackHeapBarrier|) (< 2147483647 (* 16777216 (mod |ULTIMATE.start_mp_add_~r3~0#1| 256))))' at error location [2021-11-25 18:22:40,852 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:22:40,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:22:40,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 16 [2021-11-25 18:22:40,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413249816] [2021-11-25 18:22:40,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:22:40,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:22:40,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:40,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:22:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2021-11-25 18:22:40,854 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 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) [2021-11-25 18:22:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:42,484 INFO L93 Difference]: Finished difference Result 502 states and 645 transitions. [2021-11-25 18:22:42,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-25 18:22:42,494 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-25 18:22:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:42,497 INFO L225 Difference]: With dead ends: 502 [2021-11-25 18:22:42,497 INFO L226 Difference]: Without dead ends: 436 [2021-11-25 18:22:42,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=955, Invalid=4595, Unknown=0, NotChecked=0, Total=5550 [2021-11-25 18:22:42,500 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 627 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:42,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 402 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:22:42,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-11-25 18:22:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 253. [2021-11-25 18:22:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.380952380952381) internal successors, (348), 252 states have internal predecessors, (348), 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) [2021-11-25 18:22:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 348 transitions. [2021-11-25 18:22:42,521 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 348 transitions. Word has length 33 [2021-11-25 18:22:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:42,521 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 348 transitions. [2021-11-25 18:22:42,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 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) [2021-11-25 18:22:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 348 transitions. [2021-11-25 18:22:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-25 18:22:42,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:42,523 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:42,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:22:42,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-25 18:22:42,734 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1928566613, now seen corresponding path program 1 times [2021-11-25 18:22:42,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:42,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424007747] [2021-11-25 18:22:42,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:42,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:42,858 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:42,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424007747] [2021-11-25 18:22:42,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424007747] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:22:42,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40810708] [2021-11-25 18:22:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:42,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:22:42,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:22:42,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:22:42,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:22:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:42,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-25 18:22:42,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:22:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:43,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:22:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:43,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40810708] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:22:43,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [158398165] [2021-11-25 18:22:43,874 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2021-11-25 18:22:43,875 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:22:43,875 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:22:43,875 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:22:43,875 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:22:45,278 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:22:47,580 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3525#(and (<= |ULTIMATE.start_mp_add_~carry~0#1| 1) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_mp_add_~i~0#1| 257) (<= |ULTIMATE.start_mp_add_~a0~0#1| 234770789) (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 234770789 |ULTIMATE.start_mp_add_~a#1|) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= (mod |ULTIMATE.start_mp_add_~carry~0#1| 65536) 0) (<= |ULTIMATE.start_main_~a~0#1| 234770789) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= 234770789 |ULTIMATE.start_mp_add_~a0~0#1|) (<= 0 |ULTIMATE.start_mp_add_~i~0#1|) (<= |#NULL.offset| 0) (<= 234770789 |ULTIMATE.start_mp_add_#in~a#1|) (<= |ULTIMATE.start_mp_add_#in~a#1| 234770789) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= |#NULL.base| 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) (mod |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 0 |ULTIMATE.start_mp_add_~carry~0#1|) (<= |ULTIMATE.start_mp_add_~a#1| 234770789) (<= 0 |#NULL.offset|) (<= 234770789 |ULTIMATE.start_main_~a~0#1|) (<= 0 |#StackHeapBarrier|) (< 2147483647 (* 16777216 (mod |ULTIMATE.start_mp_add_~r3~0#1| 256))))' at error location [2021-11-25 18:22:47,580 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:22:47,580 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:22:47,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 21 [2021-11-25 18:22:47,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196167847] [2021-11-25 18:22:47,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:22:47,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 18:22:47,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:47,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 18:22:47,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1053, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 18:22:47,582 INFO L87 Difference]: Start difference. First operand 253 states and 348 transitions. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 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) [2021-11-25 18:22:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:48,531 INFO L93 Difference]: Finished difference Result 733 states and 955 transitions. [2021-11-25 18:22:48,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 18:22:48,532 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-25 18:22:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:48,540 INFO L225 Difference]: With dead ends: 733 [2021-11-25 18:22:48,540 INFO L226 Difference]: Without dead ends: 619 [2021-11-25 18:22:48,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 89 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=513, Invalid=1839, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 18:22:48,542 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 505 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:48,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 258 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:22:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-11-25 18:22:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 250. [2021-11-25 18:22:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.3815261044176708) internal successors, (344), 249 states have internal predecessors, (344), 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) [2021-11-25 18:22:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 344 transitions. [2021-11-25 18:22:48,572 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 344 transitions. Word has length 42 [2021-11-25 18:22:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:48,572 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 344 transitions. [2021-11-25 18:22:48,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 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) [2021-11-25 18:22:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 344 transitions. [2021-11-25 18:22:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-25 18:22:48,574 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:48,574 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:48,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-25 18:22:48,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 18:22:48,789 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash -615663909, now seen corresponding path program 1 times [2021-11-25 18:22:48,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:48,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70190793] [2021-11-25 18:22:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:48,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:22:48,951 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:48,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70190793] [2021-11-25 18:22:48,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70190793] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:22:48,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:22:48,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 18:22:48,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60293358] [2021-11-25 18:22:48,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:22:48,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:22:48,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:48,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:22:48,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:22:48,954 INFO L87 Difference]: Start difference. First operand 250 states and 344 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:22:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:49,127 INFO L93 Difference]: Finished difference Result 703 states and 956 transitions. [2021-11-25 18:22:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:22:49,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-25 18:22:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:49,132 INFO L225 Difference]: With dead ends: 703 [2021-11-25 18:22:49,132 INFO L226 Difference]: Without dead ends: 478 [2021-11-25 18:22:49,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:22:49,134 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 85 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:49,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 138 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:22:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-11-25 18:22:49,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 391. [2021-11-25 18:22:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.3512820512820514) internal successors, (527), 390 states have internal predecessors, (527), 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) [2021-11-25 18:22:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 527 transitions. [2021-11-25 18:22:49,152 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 527 transitions. Word has length 48 [2021-11-25 18:22:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:49,154 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 527 transitions. [2021-11-25 18:22:49,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:22:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 527 transitions. [2021-11-25 18:22:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-25 18:22:49,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:49,155 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:49,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 18:22:49,156 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 544883279, now seen corresponding path program 1 times [2021-11-25 18:22:49,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:49,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234017184] [2021-11-25 18:22:49,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:49,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 18:22:49,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:49,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234017184] [2021-11-25 18:22:49,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234017184] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:22:49,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681988512] [2021-11-25 18:22:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:49,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:22:49,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:22:49,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:22:49,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:22:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:49,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:22:49,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:22:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 18:22:49,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:22:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:22:49,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681988512] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:22:49,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [161769045] [2021-11-25 18:22:49,782 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2021-11-25 18:22:49,782 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:22:49,783 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:22:49,783 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:22:49,783 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:22:51,789 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:22:53,649 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6026#(and (<= |ULTIMATE.start_mp_add_~carry~0#1| 1) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_mp_add_~i~0#1| 257) (<= |ULTIMATE.start_mp_add_~a0~0#1| 234770789) (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 234770789 |ULTIMATE.start_mp_add_~a#1|) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= (mod |ULTIMATE.start_mp_add_~carry~0#1| 65536) 0) (<= |ULTIMATE.start_main_~a~0#1| 234770789) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= 234770789 |ULTIMATE.start_mp_add_~a0~0#1|) (<= 0 |ULTIMATE.start_mp_add_~i~0#1|) (<= |#NULL.offset| 0) (<= 234770789 |ULTIMATE.start_mp_add_#in~a#1|) (<= |ULTIMATE.start_mp_add_#in~a#1| 234770789) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= |#NULL.base| 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) (mod |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 0 |ULTIMATE.start_mp_add_~carry~0#1|) (<= |ULTIMATE.start_mp_add_~a#1| 234770789) (<= 0 |#NULL.offset|) (<= 234770789 |ULTIMATE.start_main_~a~0#1|) (<= 0 |#StackHeapBarrier|) (< 2147483647 (* 16777216 (mod |ULTIMATE.start_mp_add_~r3~0#1| 256))))' at error location [2021-11-25 18:22:53,649 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:22:53,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:22:53,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-11-25 18:22:53,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404138329] [2021-11-25 18:22:53,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:22:53,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:22:53,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:53,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:22:53,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=640, Unknown=0, NotChecked=0, Total=930 [2021-11-25 18:22:53,651 INFO L87 Difference]: Start difference. First operand 391 states and 527 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 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) [2021-11-25 18:22:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:53,945 INFO L93 Difference]: Finished difference Result 1287 states and 1751 transitions. [2021-11-25 18:22:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:22:53,947 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-25 18:22:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:53,952 INFO L225 Difference]: With dead ends: 1287 [2021-11-25 18:22:53,952 INFO L226 Difference]: Without dead ends: 888 [2021-11-25 18:22:53,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 114 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=304, Invalid=688, Unknown=0, NotChecked=0, Total=992 [2021-11-25 18:22:53,955 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 239 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:53,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 302 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:22:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2021-11-25 18:22:53,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 759. [2021-11-25 18:22:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 758 states have (on average 1.3614775725593669) internal successors, (1032), 758 states have internal predecessors, (1032), 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) [2021-11-25 18:22:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1032 transitions. [2021-11-25 18:22:53,983 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1032 transitions. Word has length 48 [2021-11-25 18:22:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:53,984 INFO L470 AbstractCegarLoop]: Abstraction has 759 states and 1032 transitions. [2021-11-25 18:22:53,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 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) [2021-11-25 18:22:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1032 transitions. [2021-11-25 18:22:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-25 18:22:53,986 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:53,987 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:54,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 18:22:54,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:22:54,198 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash -902837221, now seen corresponding path program 1 times [2021-11-25 18:22:54,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:54,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799541340] [2021-11-25 18:22:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:54,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:22:54,297 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:54,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799541340] [2021-11-25 18:22:54,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799541340] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:22:54,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781100401] [2021-11-25 18:22:54,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:54,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:22:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:22:54,310 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:22:54,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:22:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:54,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:22:54,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:22:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:22:54,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:22:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 18:22:54,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781100401] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:22:54,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [347951497] [2021-11-25 18:22:54,705 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2021-11-25 18:22:54,705 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:22:54,706 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:22:54,706 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:22:54,706 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:22:56,075 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:22:58,395 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8477#(and (<= |ULTIMATE.start_mp_add_~carry~0#1| 1) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_mp_add_~i~0#1| 257) (<= |ULTIMATE.start_mp_add_~a0~0#1| 234770789) (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 234770789 |ULTIMATE.start_mp_add_~a#1|) (<= 4 |ULTIMATE.start_mp_add_~nb~0#1|) (= (mod |ULTIMATE.start_mp_add_~carry~0#1| 65536) 0) (<= |ULTIMATE.start_main_~a~0#1| 234770789) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= 234770789 |ULTIMATE.start_mp_add_~a0~0#1|) (<= 0 |ULTIMATE.start_mp_add_~i~0#1|) (<= |#NULL.offset| 0) (<= 234770789 |ULTIMATE.start_mp_add_#in~a#1|) (<= |ULTIMATE.start_mp_add_#in~a#1| 234770789) (<= |ULTIMATE.start_mp_add_~nb~0#1| 4) (<= |#NULL.base| 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) (mod |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 0 |ULTIMATE.start_mp_add_~carry~0#1|) (<= |ULTIMATE.start_mp_add_~a#1| 234770789) (<= 0 |#NULL.offset|) (<= 234770789 |ULTIMATE.start_main_~a~0#1|) (<= 0 |#StackHeapBarrier|) (< 2147483647 (* 16777216 (mod |ULTIMATE.start_mp_add_~r3~0#1| 256))))' at error location [2021-11-25 18:22:58,395 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:22:58,395 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:22:58,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 11 [2021-11-25 18:22:58,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684853514] [2021-11-25 18:22:58,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:22:58,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:22:58,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:22:58,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:22:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=607, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:22:58,398 INFO L87 Difference]: Start difference. First operand 759 states and 1032 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 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) [2021-11-25 18:22:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:22:58,602 INFO L93 Difference]: Finished difference Result 1768 states and 2454 transitions. [2021-11-25 18:22:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:22:58,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-25 18:22:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:22:58,610 INFO L225 Difference]: With dead ends: 1768 [2021-11-25 18:22:58,610 INFO L226 Difference]: Without dead ends: 1001 [2021-11-25 18:22:58,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 111 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=299, Invalid=757, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:22:58,614 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 317 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:22:58,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 100 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:22:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-11-25 18:22:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 898. [2021-11-25 18:22:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 897 states have (on average 1.3032329988851727) internal successors, (1169), 897 states have internal predecessors, (1169), 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) [2021-11-25 18:22:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1169 transitions. [2021-11-25 18:22:58,657 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1169 transitions. Word has length 48 [2021-11-25 18:22:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:22:58,657 INFO L470 AbstractCegarLoop]: Abstraction has 898 states and 1169 transitions. [2021-11-25 18:22:58,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 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) [2021-11-25 18:22:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1169 transitions. [2021-11-25 18:22:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-25 18:22:58,659 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:22:58,659 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:22:58,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:22:58,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:22:58,885 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:22:58,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:22:58,886 INFO L85 PathProgramCache]: Analyzing trace with hash -317227982, now seen corresponding path program 1 times [2021-11-25 18:22:58,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:22:58,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145912252] [2021-11-25 18:22:58,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:58,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:22:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:59,023 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:59,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145912252] [2021-11-25 18:22:59,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145912252] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:22:59,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134247203] [2021-11-25 18:22:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:22:59,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:22:59,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:22:59,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:22:59,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:22:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:59,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:22:59,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:22:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 18:22:59,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:22:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 18:22:59,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134247203] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:22:59,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [168319876] [2021-11-25 18:22:59,390 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2021-11-25 18:22:59,390 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:22:59,391 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:22:59,391 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:22:59,391 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:22:59,810 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:23:01,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [168319876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:23:01,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:23:01,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 4, 4] total 18 [2021-11-25 18:23:01,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064132991] [2021-11-25 18:23:01,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:23:01,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 18:23:01,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:23:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 18:23:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:23:01,612 INFO L87 Difference]: Start difference. First operand 898 states and 1169 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:23:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:23:02,323 INFO L93 Difference]: Finished difference Result 2152 states and 2786 transitions. [2021-11-25 18:23:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:23:02,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-25 18:23:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:23:02,333 INFO L225 Difference]: With dead ends: 2152 [2021-11-25 18:23:02,334 INFO L226 Difference]: Without dead ends: 1542 [2021-11-25 18:23:02,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:23:02,336 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 307 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:23:02,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 285 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 18:23:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2021-11-25 18:23:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 908. [2021-11-25 18:23:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 1.2998897464167585) internal successors, (1179), 907 states have internal predecessors, (1179), 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) [2021-11-25 18:23:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1179 transitions. [2021-11-25 18:23:02,390 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1179 transitions. Word has length 51 [2021-11-25 18:23:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:23:02,390 INFO L470 AbstractCegarLoop]: Abstraction has 908 states and 1179 transitions. [2021-11-25 18:23:02,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:23:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1179 transitions. [2021-11-25 18:23:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-25 18:23:02,392 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:23:02,392 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:23:02,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:23:02,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 18:23:02,609 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:23:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:23:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1863108038, now seen corresponding path program 1 times [2021-11-25 18:23:02,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:23:02,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903055627] [2021-11-25 18:23:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:23:02,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:23:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:23:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:23:02,741 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:23:02,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903055627] [2021-11-25 18:23:02,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903055627] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:23:02,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591454565] [2021-11-25 18:23:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:23:02,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:23:02,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:23:02,743 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:23:02,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:23:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:23:02,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:23:02,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:23:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:23:03,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:23:03,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591454565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:23:03,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:23:03,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-11-25 18:23:03,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107949892] [2021-11-25 18:23:03,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:23:03,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:23:03,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:23:03,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:23:03,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:23:03,073 INFO L87 Difference]: Start difference. First operand 908 states and 1179 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:23:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:23:03,245 INFO L93 Difference]: Finished difference Result 1951 states and 2484 transitions. [2021-11-25 18:23:03,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:23:03,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-25 18:23:03,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:23:03,252 INFO L225 Difference]: With dead ends: 1951 [2021-11-25 18:23:03,252 INFO L226 Difference]: Without dead ends: 1073 [2021-11-25 18:23:03,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:23:03,255 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 63 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:23:03,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 144 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:23:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-11-25 18:23:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 892. [2021-11-25 18:23:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 1.2760942760942762) internal successors, (1137), 891 states have internal predecessors, (1137), 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) [2021-11-25 18:23:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1137 transitions. [2021-11-25 18:23:03,308 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1137 transitions. Word has length 51 [2021-11-25 18:23:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:23:03,308 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 1137 transitions. [2021-11-25 18:23:03,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:23:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1137 transitions. [2021-11-25 18:23:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-25 18:23:03,310 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:23:03,310 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:23:03,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:23:03,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:23:03,533 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:23:03,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:23:03,534 INFO L85 PathProgramCache]: Analyzing trace with hash -131931642, now seen corresponding path program 1 times [2021-11-25 18:23:03,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:23:03,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927233932] [2021-11-25 18:23:03,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:23:03,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:23:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:23:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 18:23:03,642 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:23:03,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927233932] [2021-11-25 18:23:03,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927233932] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:23:03,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791890732] [2021-11-25 18:23:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:23:03,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:23:03,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:23:03,644 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:23:03,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:23:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:23:03,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 18:23:03,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:23:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:23:04,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:23:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 18:23:04,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791890732] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:23:04,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [727239110] [2021-11-25 18:23:04,201 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2021-11-25 18:23:04,202 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:23:04,202 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:23:04,202 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:23:04,202 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:23:05,587 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:23:08,309 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18302#(and (<= |ULTIMATE.start_mp_add_~carry~0#1| 1) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_mp_add_~i~0#1| 257) (<= |ULTIMATE.start_mp_add_~a0~0#1| 234770789) (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 234770789 |ULTIMATE.start_mp_add_~a#1|) (= (mod |ULTIMATE.start_mp_add_~carry~0#1| 65536) 0) (<= |ULTIMATE.start_main_~a~0#1| 234770789) (<= |ULTIMATE.start_mp_add_~nb~0#1| 3) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= 234770789 |ULTIMATE.start_mp_add_~a0~0#1|) (<= 3 |ULTIMATE.start_mp_add_~nb~0#1|) (<= 0 |ULTIMATE.start_mp_add_~i~0#1|) (<= |#NULL.offset| 0) (<= 234770789 |ULTIMATE.start_mp_add_#in~a#1|) (<= |ULTIMATE.start_mp_add_#in~a#1| 234770789) (<= |#NULL.base| 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) (mod |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 0 |ULTIMATE.start_mp_add_~carry~0#1|) (<= |ULTIMATE.start_mp_add_~a#1| 234770789) (<= 0 |#NULL.offset|) (<= 234770789 |ULTIMATE.start_main_~a~0#1|) (<= 0 |#StackHeapBarrier|) (< 2147483647 (* 16777216 (mod |ULTIMATE.start_mp_add_~r3~0#1| 256))))' at error location [2021-11-25 18:23:08,310 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:23:08,310 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:23:08,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2021-11-25 18:23:08,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790668457] [2021-11-25 18:23:08,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:23:08,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:23:08,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:23:08,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:23:08,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 18:23:08,313 INFO L87 Difference]: Start difference. First operand 892 states and 1137 transitions. Second operand has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 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) [2021-11-25 18:23:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:23:10,851 INFO L93 Difference]: Finished difference Result 2136 states and 2653 transitions. [2021-11-25 18:23:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-11-25 18:23:10,851 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-25 18:23:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:23:10,858 INFO L225 Difference]: With dead ends: 2136 [2021-11-25 18:23:10,858 INFO L226 Difference]: Without dead ends: 1213 [2021-11-25 18:23:10,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 155 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2838 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1171, Invalid=6311, Unknown=0, NotChecked=0, Total=7482 [2021-11-25 18:23:10,863 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 1064 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:23:10,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1064 Valid, 598 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 18:23:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2021-11-25 18:23:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 775. [2021-11-25 18:23:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 1.144702842377261) internal successors, (886), 774 states have internal predecessors, (886), 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) [2021-11-25 18:23:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 886 transitions. [2021-11-25 18:23:10,911 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 886 transitions. Word has length 51 [2021-11-25 18:23:10,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:23:10,911 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 886 transitions. [2021-11-25 18:23:10,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 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) [2021-11-25 18:23:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 886 transitions. [2021-11-25 18:23:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-25 18:23:10,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:23:10,913 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:23:10,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 18:23:11,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 18:23:11,130 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:23:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:23:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash 559000721, now seen corresponding path program 1 times [2021-11-25 18:23:11,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:23:11,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539558718] [2021-11-25 18:23:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:23:11,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:23:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:23:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-25 18:23:11,260 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:23:11,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539558718] [2021-11-25 18:23:11,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539558718] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:23:11,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:23:11,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 18:23:11,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601191497] [2021-11-25 18:23:11,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:23:11,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:23:11,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:23:11,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:23:11,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:23:11,262 INFO L87 Difference]: Start difference. First operand 775 states and 886 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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) [2021-11-25 18:23:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:23:11,570 INFO L93 Difference]: Finished difference Result 2165 states and 2465 transitions. [2021-11-25 18:23:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:23:11,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-25 18:23:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:23:11,585 INFO L225 Difference]: With dead ends: 2165 [2021-11-25 18:23:11,585 INFO L226 Difference]: Without dead ends: 1549 [2021-11-25 18:23:11,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:23:11,587 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 223 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:23:11,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 430 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:23:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2021-11-25 18:23:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 785. [2021-11-25 18:23:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 784 states have (on average 1.1428571428571428) internal successors, (896), 784 states have internal predecessors, (896), 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) [2021-11-25 18:23:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 896 transitions. [2021-11-25 18:23:11,641 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 896 transitions. Word has length 66 [2021-11-25 18:23:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:23:11,641 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 896 transitions. [2021-11-25 18:23:11,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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) [2021-11-25 18:23:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 896 transitions. [2021-11-25 18:23:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-25 18:23:11,643 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:23:11,643 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:23:11,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-25 18:23:11,643 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:23:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:23:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1893290917, now seen corresponding path program 1 times [2021-11-25 18:23:11,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:23:11,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095588704] [2021-11-25 18:23:11,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:23:11,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:23:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:23:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-25 18:23:11,979 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:23:11,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095588704] [2021-11-25 18:23:11,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095588704] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:23:11,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676887433] [2021-11-25 18:23:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:23:11,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:23:11,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:23:11,980 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:23:11,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 18:23:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:23:12,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-25 18:23:12,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:23:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:23:13,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:23:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-25 18:23:15,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676887433] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:23:15,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [381737503] [2021-11-25 18:23:15,648 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2021-11-25 18:23:15,649 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:23:15,650 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:23:15,650 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:23:15,651 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:23:17,369 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:23:22,160 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '25136#(and (<= |ULTIMATE.start_mp_add_~carry~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~i~0#1| 257) (<= |ULTIMATE.start_mp_add_~a0~0#1| 234770789) (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 234770789 |ULTIMATE.start_mp_add_~a#1|) (= (mod |ULTIMATE.start_mp_add_~carry~0#1| 65536) 0) (<= |ULTIMATE.start_main_~a~0#1| 234770789) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= 234770789 |ULTIMATE.start_mp_add_~a0~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 2) (<= 0 |ULTIMATE.start_mp_add_~i~0#1|) (<= |#NULL.offset| 0) (<= 234770789 |ULTIMATE.start_mp_add_#in~a#1|) (<= |ULTIMATE.start_mp_add_#in~a#1| 234770789) (<= |#NULL.base| 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) (mod |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 0 |ULTIMATE.start_mp_add_~carry~0#1|) (<= |ULTIMATE.start_mp_add_~a#1| 234770789) (<= 0 |#NULL.offset|) (<= 234770789 |ULTIMATE.start_main_~a~0#1|) (<= 0 |#StackHeapBarrier|) (< 2147483647 (* 16777216 (mod |ULTIMATE.start_mp_add_~r3~0#1| 256))))' at error location [2021-11-25 18:23:22,161 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:23:22,161 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:23:22,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 31 [2021-11-25 18:23:22,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757546933] [2021-11-25 18:23:22,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:23:22,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-25 18:23:22,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:23:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-25 18:23:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2525, Unknown=0, NotChecked=0, Total=2970 [2021-11-25 18:23:22,164 INFO L87 Difference]: Start difference. First operand 785 states and 896 transitions. Second operand has 32 states, 31 states have (on average 3.935483870967742) internal successors, (122), 32 states have internal predecessors, (122), 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) [2021-11-25 18:23:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:23:29,170 INFO L93 Difference]: Finished difference Result 1804 states and 2040 transitions. [2021-11-25 18:23:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-11-25 18:23:29,171 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.935483870967742) internal successors, (122), 32 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-25 18:23:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:23:29,175 INFO L225 Difference]: With dead ends: 1804 [2021-11-25 18:23:29,175 INFO L226 Difference]: Without dead ends: 927 [2021-11-25 18:23:29,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 161 SyntacticMatches, 7 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4652 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1665, Invalid=10767, Unknown=0, NotChecked=0, Total=12432 [2021-11-25 18:23:29,183 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 490 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 592 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:23:29,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 660 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1408 Invalid, 0 Unknown, 592 Unchecked, 2.0s Time] [2021-11-25 18:23:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2021-11-25 18:23:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 621. [2021-11-25 18:23:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 620 states have (on average 1.1258064516129032) internal successors, (698), 620 states have internal predecessors, (698), 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) [2021-11-25 18:23:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 698 transitions. [2021-11-25 18:23:29,234 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 698 transitions. Word has length 66 [2021-11-25 18:23:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:23:29,234 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 698 transitions. [2021-11-25 18:23:29,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.935483870967742) internal successors, (122), 32 states have internal predecessors, (122), 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) [2021-11-25 18:23:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 698 transitions. [2021-11-25 18:23:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-25 18:23:29,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:23:29,237 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:23:29,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 18:23:29,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 18:23:29,461 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:23:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:23:29,462 INFO L85 PathProgramCache]: Analyzing trace with hash -385371059, now seen corresponding path program 1 times [2021-11-25 18:23:29,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:23:29,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102233408] [2021-11-25 18:23:29,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:23:29,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:23:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:23:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-25 18:23:29,652 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:23:29,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102233408] [2021-11-25 18:23:29,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102233408] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:23:29,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:23:29,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 18:23:29,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075030584] [2021-11-25 18:23:29,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:23:29,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:23:29,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:23:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:23:29,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:23:29,655 INFO L87 Difference]: Start difference. First operand 621 states and 698 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:23:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:23:30,296 INFO L93 Difference]: Finished difference Result 1337 states and 1485 transitions. [2021-11-25 18:23:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:23:30,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-11-25 18:23:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:23:30,304 INFO L225 Difference]: With dead ends: 1337 [2021-11-25 18:23:30,304 INFO L226 Difference]: Without dead ends: 1272 [2021-11-25 18:23:30,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:23:30,306 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 296 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:23:30,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 638 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:23:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2021-11-25 18:23:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 620. [2021-11-25 18:23:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.1260096930533119) internal successors, (697), 619 states have internal predecessors, (697), 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) [2021-11-25 18:23:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 697 transitions. [2021-11-25 18:23:30,363 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 697 transitions. Word has length 68 [2021-11-25 18:23:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:23:30,364 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 697 transitions. [2021-11-25 18:23:30,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:23:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 697 transitions. [2021-11-25 18:23:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-25 18:23:30,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:23:30,366 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:23:30,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-25 18:23:30,366 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:23:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:23:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash -99253601, now seen corresponding path program 1 times [2021-11-25 18:23:30,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:23:30,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711304317] [2021-11-25 18:23:30,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:23:30,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:23:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:23:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-25 18:23:30,565 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:23:30,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711304317] [2021-11-25 18:23:30,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711304317] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:23:30,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335464097] [2021-11-25 18:23:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:23:30,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:23:30,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:23:30,567 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:23:30,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 18:23:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:23:30,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-25 18:23:30,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:23:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-25 18:23:43,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:24:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:24:16,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335464097] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:24:16,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [408290437] [2021-11-25 18:24:16,989 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2021-11-25 18:24:16,989 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:24:16,989 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:24:16,989 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:24:16,990 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:24:18,586 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:24:22,775 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '30443#(and (<= |ULTIMATE.start_mp_add_~carry~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_mp_add_~nb~0#1|) (<= |ULTIMATE.start_mp_add_~i~0#1| 257) (<= |ULTIMATE.start_mp_add_~a0~0#1| 234770789) (<= |ULTIMATE.start_mp_add_~na~0#1| 4) (<= 234770789 |ULTIMATE.start_mp_add_~a#1|) (= (mod |ULTIMATE.start_mp_add_~carry~0#1| 65536) 0) (<= |ULTIMATE.start_main_~a~0#1| 234770789) (<= 4 |ULTIMATE.start_mp_add_~na~0#1|) (<= 234770789 |ULTIMATE.start_mp_add_~a0~0#1|) (<= |ULTIMATE.start_mp_add_~nb~0#1| 2) (<= 0 |ULTIMATE.start_mp_add_~i~0#1|) (<= |#NULL.offset| 0) (<= 234770789 |ULTIMATE.start_mp_add_#in~a#1|) (<= |ULTIMATE.start_mp_add_#in~a#1| 234770789) (<= |#NULL.base| 0) (<= (mod |ULTIMATE.start_mp_add_~na~0#1| 256) (mod |ULTIMATE.start_mp_add_~i~0#1| 256)) (<= 0 |ULTIMATE.start_mp_add_~carry~0#1|) (<= |ULTIMATE.start_mp_add_~a#1| 234770789) (<= 0 |#NULL.offset|) (<= 234770789 |ULTIMATE.start_main_~a~0#1|) (<= 0 |#StackHeapBarrier|) (< 2147483647 (* 16777216 (mod |ULTIMATE.start_mp_add_~r3~0#1| 256))))' at error location [2021-11-25 18:24:22,775 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:24:22,775 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:24:22,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 13] total 30 [2021-11-25 18:24:22,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044327514] [2021-11-25 18:24:22,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:24:22,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 18:24:22,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:24:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 18:24:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2499, Unknown=1, NotChecked=0, Total=2862 [2021-11-25 18:24:22,778 INFO L87 Difference]: Start difference. First operand 620 states and 697 transitions. Second operand has 30 states, 30 states have (on average 6.366666666666666) internal successors, (191), 30 states have internal predecessors, (191), 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) [2021-11-25 18:24:33,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:24:40,029 WARN L227 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 66 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:24:48,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:24:50,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:24:53,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:24:54,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:25:00,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:25:14,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:25:16,936 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:25:19,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:25:21,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:25:33,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:25:47,751 WARN L227 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 89 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:25:49,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:26:24,487 WARN L227 SmtUtils]: Spent 27.21s on a formula simplification. DAG size of input: 86 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:26:33,296 WARN L227 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 96 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:26:44,187 WARN L227 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 100 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:27:39,692 WARN L227 SmtUtils]: Spent 21.86s on a formula simplification. DAG size of input: 93 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:27:49,297 WARN L227 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 107 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:28:05,538 WARN L227 SmtUtils]: Spent 11.72s on a formula simplification. DAG size of input: 91 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:28:31,713 WARN L227 SmtUtils]: Spent 13.79s on a formula simplification. DAG size of input: 94 DAG size of output: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:28:33,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:28:59,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:29:02,889 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:29:19,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:29:39,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:29:42,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:29:52,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:30:00,886 WARN L227 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:30:02,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:30:05,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:30:15,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:30:17,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:30:25,725 WARN L227 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 101 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:30:30,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:30:34,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:30:36,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-25 18:30:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:30:36,739 INFO L93 Difference]: Finished difference Result 2027 states and 2240 transitions. [2021-11-25 18:30:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2021-11-25 18:30:36,740 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.366666666666666) internal successors, (191), 30 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-25 18:30:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:30:36,742 INFO L225 Difference]: With dead ends: 2027 [2021-11-25 18:30:36,743 INFO L226 Difference]: Without dead ends: 661 [2021-11-25 18:30:36,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 176 SyntacticMatches, 11 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9438 ImplicationChecksByTransitivity, 302.6s TimeCoverageRelationStatistics Valid=3388, Invalid=22045, Unknown=7, NotChecked=0, Total=25440 [2021-11-25 18:30:36,752 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 1043 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 321 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 3052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 87.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:30:36,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 1478 Invalid, 3052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 2654 Invalid, 13 Unknown, 64 Unchecked, 87.9s Time] [2021-11-25 18:30:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-11-25 18:30:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 436. [2021-11-25 18:30:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.1126436781609195) internal successors, (484), 435 states have internal predecessors, (484), 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) [2021-11-25 18:30:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 484 transitions. [2021-11-25 18:30:36,785 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 484 transitions. Word has length 72 [2021-11-25 18:30:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:30:36,785 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 484 transitions. [2021-11-25 18:30:36,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.366666666666666) internal successors, (191), 30 states have internal predecessors, (191), 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) [2021-11-25 18:30:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 484 transitions. [2021-11-25 18:30:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-25 18:30:36,787 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:30:36,787 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:30:36,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-11-25 18:30:36,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:30:36,994 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-11-25 18:30:36,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:30:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1169503046, now seen corresponding path program 1 times [2021-11-25 18:30:36,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:30:36,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64706562] [2021-11-25 18:30:36,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:30:36,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:30:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:30:37,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 18:30:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:30:37,223 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 18:30:37,223 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 18:30:37,224 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2021-11-25 18:30:37,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2021-11-25 18:30:37,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2021-11-25 18:30:37,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2021-11-25 18:30:37,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2021-11-25 18:30:37,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2021-11-25 18:30:37,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2021-11-25 18:30:37,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2021-11-25 18:30:37,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2021-11-25 18:30:37,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2021-11-25 18:30:37,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2021-11-25 18:30:37,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2021-11-25 18:30:37,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2021-11-25 18:30:37,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2021-11-25 18:30:37,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2021-11-25 18:30:37,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2021-11-25 18:30:37,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2021-11-25 18:30:37,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2021-11-25 18:30:37,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2021-11-25 18:30:37,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2021-11-25 18:30:37,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2021-11-25 18:30:37,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2021-11-25 18:30:37,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2021-11-25 18:30:37,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2021-11-25 18:30:37,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2021-11-25 18:30:37,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2021-11-25 18:30:37,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2021-11-25 18:30:37,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2021-11-25 18:30:37,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2021-11-25 18:30:37,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2021-11-25 18:30:37,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2021-11-25 18:30:37,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2021-11-25 18:30:37,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2021-11-25 18:30:37,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2021-11-25 18:30:37,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2021-11-25 18:30:37,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2021-11-25 18:30:37,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2021-11-25 18:30:37,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2021-11-25 18:30:37,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-25 18:30:37,239 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:30:37,243 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 18:30:37,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:30:37 BoogieIcfgContainer [2021-11-25 18:30:37,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 18:30:37,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 18:30:37,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 18:30:37,397 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 18:30:37,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:26" (3/4) ... [2021-11-25 18:30:37,400 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-25 18:30:37,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 18:30:37,402 INFO L158 Benchmark]: Toolchain (without parser) took 491621.09ms. Allocated memory was 113.2MB in the beginning and 314.6MB in the end (delta: 201.3MB). Free memory was 74.2MB in the beginning and 238.0MB in the end (delta: -163.8MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2021-11-25 18:30:37,402 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 113.2MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:30:37,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.32ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 86.7MB in the end (delta: -12.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-25 18:30:37,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.57ms. Allocated memory is still 113.2MB. Free memory was 86.7MB in the beginning and 84.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 18:30:37,406 INFO L158 Benchmark]: Boogie Preprocessor took 30.70ms. Allocated memory is still 113.2MB. Free memory was 84.5MB in the beginning and 83.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 18:30:37,406 INFO L158 Benchmark]: RCFGBuilder took 511.51ms. Allocated memory is still 113.2MB. Free memory was 83.1MB in the beginning and 65.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-25 18:30:37,408 INFO L158 Benchmark]: TraceAbstraction took 490557.82ms. Allocated memory was 113.2MB in the beginning and 314.6MB in the end (delta: 201.3MB). Free memory was 65.1MB in the beginning and 238.0MB in the end (delta: -172.9MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2021-11-25 18:30:37,409 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 314.6MB. Free memory is still 238.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:30:37,413 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.39ms. Allocated memory is still 113.2MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.32ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 86.7MB in the end (delta: -12.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.57ms. Allocated memory is still 113.2MB. Free memory was 86.7MB in the beginning and 84.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.70ms. Allocated memory is still 113.2MB. Free memory was 84.5MB in the beginning and 83.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.51ms. Allocated memory is still 113.2MB. Free memory was 83.1MB in the beginning and 65.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 490557.82ms. Allocated memory was 113.2MB in the beginning and 314.6MB in the end (delta: 201.3MB). Free memory was 65.1MB in the beginning and 238.0MB in the end (delta: -172.9MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 314.6MB. Free memory is still 238.0MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum [L100] COND FALSE !(i == (unsigned char)1) [L101] COND FALSE !(i == (unsigned char)2) [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=0, na=4, nb=4, partial_sum=255, r0=255, r1=4060196507, r2=4060196508, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=255, r0=255, r1=4060196507, r2=4060196508, r3=255] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=255, r1=4060196507, r2=4060196508, r3=255] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=255, r1=4060196507, r2=4060196508, r3=255] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=255, r1=4060196507, r2=4060196508, r3=255] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=255, r1=4060196507, r2=4060196508, r3=255] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255, r1=4060196507, r2=4060196508, r3=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255, r1=4060196507, r2=4060196508, r3=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255, r1=4060196507, r2=4060196508, r3=255] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255, r1=4060196507, r2=4060196508, r3=255] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255, r1=4060196507, r2=4060196508, r3=255] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255, r1=4060196507, r2=4060196508, r3=255] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=255, r0=255, r1=4060196507, r2=4060196508, r3=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=255, r0=255, r1=4060196507, r2=4060196508, r3=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=255, r0=255, r1=4060196507, r2=4060196508, r3=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) [L99] COND FALSE !(i == (unsigned char)0) [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum [L101] COND FALSE !(i == (unsigned char)2) [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=1, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=4060196508, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=4060196508, r3=255] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=4060196508, r3=255] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=4060196508, r3=255] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=4060196508, r3=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=4060196508, r3=255] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=4060196508, r3=255] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=255, r2=4060196508, r3=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=255, r2=4060196508, r3=255] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=255, r2=4060196508, r3=255] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=255, r2=4060196508, r3=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=255, r2=4060196508, r3=255] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=255, r2=4060196508, r3=255] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=4060196508, r3=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=4060196508, r3=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) [L99] COND FALSE !(i == (unsigned char)0) [L100] COND FALSE !(i == (unsigned char)1) [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=255, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=255, r3=255] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=255, r3=255] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=255, r3=255] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=255, r3=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=255, r3=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=255, r3=255] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=255, r2=255, r3=255] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=255, r2=255, r3=255] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=255, r2=255, r3=255] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=255, r2=255, r3=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=255, r2=255, r3=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=255, r2=255, r3=255] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=255, r2=255, r3=255] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=255, r3=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) [L99] COND FALSE !(i == (unsigned char)0) [L100] COND FALSE !(i == (unsigned char)1) [L101] COND FALSE !(i == (unsigned char)2) [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=255, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=255, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=255, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=255, r3=255] [L116] r1 << 8U VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=255, r3=255] [L116] r2 << 16U VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=255, r3=255] [L116] r3 << 24U VAL [\old(a)=234770789, \old(b)=4060196506, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=4060196506, b0=4060196506, b1=15860142, b2=61953, b3=242, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=255, r1=255, r2=255, r3=255] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 490.3s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 390.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 5741 SdHoareTripleChecker+Valid, 94.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5741 mSDsluCounter, 6512 SdHoareTripleChecker+Invalid, 92.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 656 IncrementalHoareTripleChecker+Unchecked, 5194 mSDsCounter, 929 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8516 IncrementalHoareTripleChecker+Invalid, 10114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 929 mSolverCounterUnsat, 1403 mSDtfsCounter, 8516 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1772 GetRequests, 1102 SyntacticMatches, 70 SemanticMatches, 600 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21456 ImplicationChecksByTransitivity, 331.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=908occurred in iteration=14, InterpolantAutomatonStates: 416, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 4292 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 55.6s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1645 ConstructedInterpolants, 60 QuantifiedInterpolants, 26167 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 37 InterpolantComputations, 12 PerfectInterpolantSequences, 755/989 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: 0.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 29, DAG_INTERPRETER_EARLY_EXITS: 7, TOOLS_POST_APPLICATIONS: 40, TOOLS_POST_TIME: 0.3s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 36, TOOLS_QUANTIFIERELIM_TIME: 0.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 60, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 29, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 2833, DAG_COMPRESSION_RETAINED_NODES: 103, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-25 18:30:37,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/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 Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b07dc61-fdff-44d7-ba07-a06882450a7d/bin/utaipan-eEHZpOm5b7/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample