./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/busybox-1.22.0/hostid.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan --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 64bit --witnessprinter.graph.data.programhash 8604245f5a4dee50703be8e530b281b92acb588c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:48,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:48,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:48,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:48,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:48,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:48,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:48,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:48,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:48,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:48,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:48,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:48,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:48,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:48,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:48,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:48,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:48,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:48,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:48,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:48,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:48,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:48,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:48,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:48,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:48,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:48,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:48,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:48,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:48,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:48,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:48,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:48,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:48,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:48,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:48,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:48,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:48,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:48,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:48,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:48,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:48,403 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-10-22 11:24:48,414 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:48,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:48,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:48,416 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:48,416 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:48,416 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:48,416 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:48,416 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:48,417 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:48,417 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:48,417 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:48,417 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:48,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:48,418 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:24:48,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:48,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:48,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:48,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:48,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:48,419 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-10-22 11:24:48,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:48,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:48,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:48,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:48,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:48,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:48,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:48,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:48,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:48,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:48,421 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:48,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:48,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:48,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:48,421 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8604245f5a4dee50703be8e530b281b92acb588c [2019-10-22 11:24:48,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:48,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:48,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:48,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:48,461 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:48,462 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/../../sv-benchmarks/c/busybox-1.22.0/hostid.i [2019-10-22 11:24:48,517 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/data/e0c1f2024/e1819a6bbbbf4c6388b76db4a32b3b77/FLAG1fd83c4a8 [2019-10-22 11:24:49,071 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:49,072 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/sv-benchmarks/c/busybox-1.22.0/hostid.i [2019-10-22 11:24:49,099 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/data/e0c1f2024/e1819a6bbbbf4c6388b76db4a32b3b77/FLAG1fd83c4a8 [2019-10-22 11:24:49,484 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/data/e0c1f2024/e1819a6bbbbf4c6388b76db4a32b3b77 [2019-10-22 11:24:49,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:49,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:49,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:49,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:49,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:49,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:49" (1/1) ... [2019-10-22 11:24:49,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7c0b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:49, skipping insertion in model container [2019-10-22 11:24:49,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:49" (1/1) ... [2019-10-22 11:24:49,502 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:49,573 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:50,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:50,417 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:50,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:50,823 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:50,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50 WrapperNode [2019-10-22 11:24:50,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:50,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:50,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:50,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:50,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:50,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:50,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:50,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:50,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:51,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:51,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:51,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:51,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:51,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:51,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:51,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:51,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-10-22 11:24:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:51,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:24:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:24:51,848 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:51,849 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-10-22 11:24:51,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:51 BoogieIcfgContainer [2019-10-22 11:24:51,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:51,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:51,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:51,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:51,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:49" (1/3) ... [2019-10-22 11:24:51,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d81c50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:51, skipping insertion in model container [2019-10-22 11:24:51,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (2/3) ... [2019-10-22 11:24:51,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d81c50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:51, skipping insertion in model container [2019-10-22 11:24:51,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:51" (3/3) ... [2019-10-22 11:24:51,859 INFO L109 eAbstractionObserver]: Analyzing ICFG hostid.i [2019-10-22 11:24:51,869 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:51,877 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-22 11:24:51,889 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-22 11:24:51,913 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:51,913 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:51,913 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:51,913 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:51,913 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:51,914 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:51,914 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:51,914 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-10-22 11:24:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-10-22 11:24:51,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,936 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-10-22 11:24:51,939 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-10-22 11:24:51,953 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431049891] [2019-10-22 11:24:51,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431049891] [2019-10-22 11:24:52,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:52,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659778728] [2019-10-22 11:24:52,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:52,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:52,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:52,409 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-10-22 11:24:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,448 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2019-10-22 11:24:52,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:52,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-10-22 11:24:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,458 INFO L225 Difference]: With dead ends: 92 [2019-10-22 11:24:52,458 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:24:52,461 INFO L600 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 [2019-10-22 11:24:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:24:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 11:24:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:24:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-22 11:24:52,492 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2019-10-22 11:24:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,493 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-22 11:24:52,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-22 11:24:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:24:52,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:24:52,494 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash 28698760, now seen corresponding path program 1 times [2019-10-22 11:24:52,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093260328] [2019-10-22 11:24:52,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093260328] [2019-10-22 11:24:52,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:52,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415392251] [2019-10-22 11:24:52,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:52,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:52,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:52,628 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-10-22 11:24:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,652 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-10-22 11:24:52,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:52,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-10-22 11:24:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,653 INFO L225 Difference]: With dead ends: 48 [2019-10-22 11:24:52,653 INFO L226 Difference]: Without dead ends: 47 [2019-10-22 11:24:52,654 INFO L600 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 [2019-10-22 11:24:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-22 11:24:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-22 11:24:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:24:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-22 11:24:52,658 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 5 [2019-10-22 11:24:52,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,659 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-22 11:24:52,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-22 11:24:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:24:52,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,659 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,661 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash 266305344, now seen corresponding path program 1 times [2019-10-22 11:24:52,662 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153300476] [2019-10-22 11:24:52,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:52,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153300476] [2019-10-22 11:24:52,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:52,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070414376] [2019-10-22 11:24:52,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:52,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:52,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:52,766 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 3 states. [2019-10-22 11:24:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,838 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-10-22 11:24:52,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:52,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-22 11:24:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,840 INFO L225 Difference]: With dead ends: 47 [2019-10-22 11:24:52,840 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 11:24:52,840 INFO L600 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 [2019-10-22 11:24:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 11:24:52,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-22 11:24:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 11:24:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-22 11:24:52,847 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2019-10-22 11:24:52,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,848 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-22 11:24:52,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-22 11:24:52,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:24:52,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,848 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-10-22 11:24:52,849 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,849 INFO L82 PathProgramCache]: Analyzing trace with hash 266307074, now seen corresponding path program 1 times [2019-10-22 11:24:52,849 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882790194] [2019-10-22 11:24:52,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882790194] [2019-10-22 11:24:52,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:52,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34507215] [2019-10-22 11:24:52,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:52,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:52,940 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2019-10-22 11:24:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,958 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-22 11:24:52,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:52,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-22 11:24:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,960 INFO L225 Difference]: With dead ends: 43 [2019-10-22 11:24:52,960 INFO L226 Difference]: Without dead ends: 42 [2019-10-22 11:24:52,960 INFO L600 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 [2019-10-22 11:24:52,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-22 11:24:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-22 11:24:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:24:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-22 11:24:52,967 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 8 [2019-10-22 11:24:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,967 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-22 11:24:52,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-22 11:24:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:24:52,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,968 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,968 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash -334468875, now seen corresponding path program 1 times [2019-10-22 11:24:52,969 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731081379] [2019-10-22 11:24:52,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:53,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731081379] [2019-10-22 11:24:53,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:53,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662526788] [2019-10-22 11:24:53,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:53,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:53,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:53,060 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2019-10-22 11:24:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,122 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-10-22 11:24:53,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:53,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-10-22 11:24:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,124 INFO L225 Difference]: With dead ends: 40 [2019-10-22 11:24:53,124 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:24:53,124 INFO L600 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 [2019-10-22 11:24:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:24:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-22 11:24:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:24:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-22 11:24:53,131 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 9 [2019-10-22 11:24:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,131 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-22 11:24:53,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-22 11:24:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:53,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,132 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:53,132 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:53,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash 697960087, now seen corresponding path program 1 times [2019-10-22 11:24:53,133 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370162069] [2019-10-22 11:24:53,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:53,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370162069] [2019-10-22 11:24:53,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:53,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173294001] [2019-10-22 11:24:53,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:53,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:53,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:53,224 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-10-22 11:24:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,284 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-10-22 11:24:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:53,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 11:24:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,286 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:24:53,286 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:24:53,287 INFO L600 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 [2019-10-22 11:24:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:24:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:24:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:24:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-22 11:24:53,291 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 11 [2019-10-22 11:24:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,291 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-22 11:24:53,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-22 11:24:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:24:53,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,294 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:53,295 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:53,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,295 INFO L82 PathProgramCache]: Analyzing trace with hash -557684678, now seen corresponding path program 1 times [2019-10-22 11:24:53,295 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346550735] [2019-10-22 11:24:53,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:53,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346550735] [2019-10-22 11:24:53,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:53,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653032473] [2019-10-22 11:24:53,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:53,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:53,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:53,377 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2019-10-22 11:24:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,406 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-10-22 11:24:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:53,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 11:24:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,408 INFO L225 Difference]: With dead ends: 60 [2019-10-22 11:24:53,408 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:24:53,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:24:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-22 11:24:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:24:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-22 11:24:53,412 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-10-22 11:24:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,413 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-22 11:24:53,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-22 11:24:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:53,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,414 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:53,414 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017679, now seen corresponding path program 1 times [2019-10-22 11:24:53,414 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169687382] [2019-10-22 11:24:53,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:53,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169687382] [2019-10-22 11:24:53,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:53,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353580027] [2019-10-22 11:24:53,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:53,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:53,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:53,525 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2019-10-22 11:24:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,628 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-10-22 11:24:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:53,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-22 11:24:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,630 INFO L225 Difference]: With dead ends: 51 [2019-10-22 11:24:53,630 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:24:53,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:24:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-10-22 11:24:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:24:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-22 11:24:53,634 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-10-22 11:24:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,635 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-22 11:24:53,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-22 11:24:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:53,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,638 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:53,639 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:53,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017624, now seen corresponding path program 1 times [2019-10-22 11:24:53,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892950083] [2019-10-22 11:24:53,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:53,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892950083] [2019-10-22 11:24:53,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:53,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848026659] [2019-10-22 11:24:53,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:53,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:53,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:53,749 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-10-22 11:24:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,782 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-10-22 11:24:53,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:53,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 11:24:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,784 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:24:53,784 INFO L226 Difference]: Without dead ends: 37 [2019-10-22 11:24:53,784 INFO L600 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 [2019-10-22 11:24:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-22 11:24:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-22 11:24:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 11:24:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-22 11:24:53,792 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2019-10-22 11:24:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,792 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-22 11:24:53,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-22 11:24:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:53,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,794 INFO L380 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] [2019-10-22 11:24:53,794 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:53,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1840190412, now seen corresponding path program 1 times [2019-10-22 11:24:53,795 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225448555] [2019-10-22 11:24:53,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:53,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225448555] [2019-10-22 11:24:53,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:53,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122765668] [2019-10-22 11:24:53,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:53,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:53,903 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 3 states. [2019-10-22 11:24:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,953 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-10-22 11:24:53,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:53,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 11:24:53,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,954 INFO L225 Difference]: With dead ends: 59 [2019-10-22 11:24:53,954 INFO L226 Difference]: Without dead ends: 58 [2019-10-22 11:24:53,955 INFO L600 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 [2019-10-22 11:24:53,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-22 11:24:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-10-22 11:24:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 11:24:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-10-22 11:24:53,959 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2019-10-22 11:24:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,959 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-10-22 11:24:53,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-10-22 11:24:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:53,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,963 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:53,964 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:53,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1840192110, now seen corresponding path program 1 times [2019-10-22 11:24:53,964 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144628728] [2019-10-22 11:24:53,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:54,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144628728] [2019-10-22 11:24:54,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:54,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:54,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376379092] [2019-10-22 11:24:54,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:54,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:54,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:54,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:54,068 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 3 states. [2019-10-22 11:24:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:54,092 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-10-22 11:24:54,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:54,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 11:24:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:54,097 INFO L225 Difference]: With dead ends: 57 [2019-10-22 11:24:54,097 INFO L226 Difference]: Without dead ends: 56 [2019-10-22 11:24:54,097 INFO L600 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 [2019-10-22 11:24:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-22 11:24:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-10-22 11:24:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:24:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-10-22 11:24:54,107 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 22 [2019-10-22 11:24:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:54,107 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-10-22 11:24:54,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-10-22 11:24:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:24:54,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:54,108 INFO L380 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] [2019-10-22 11:24:54,108 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:54,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:54,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2077877290, now seen corresponding path program 1 times [2019-10-22 11:24:54,109 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:54,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906039362] [2019-10-22 11:24:54,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:54,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906039362] [2019-10-22 11:24:54,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:54,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:54,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224574996] [2019-10-22 11:24:54,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:54,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:54,217 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-10-22 11:24:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:54,297 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-22 11:24:54,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:54,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-22 11:24:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:54,298 INFO L225 Difference]: With dead ends: 42 [2019-10-22 11:24:54,298 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:24:54,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:24:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-10-22 11:24:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:24:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-10-22 11:24:54,302 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2019-10-22 11:24:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:54,302 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-10-22 11:24:54,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-10-22 11:24:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:24:54,303 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:54,303 INFO L380 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, 1] [2019-10-22 11:24:54,303 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:54,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:54,309 INFO L82 PathProgramCache]: Analyzing trace with hash 10313574, now seen corresponding path program 1 times [2019-10-22 11:24:54,309 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:54,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606384787] [2019-10-22 11:24:54,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:54,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606384787] [2019-10-22 11:24:54,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:54,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:54,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563372470] [2019-10-22 11:24:54,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:54,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:54,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:54,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:54,383 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2019-10-22 11:24:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:54,407 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-10-22 11:24:54,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:54,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:24:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:54,408 INFO L225 Difference]: With dead ends: 44 [2019-10-22 11:24:54,408 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 11:24:54,408 INFO L600 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 [2019-10-22 11:24:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 11:24:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-22 11:24:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 11:24:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-10-22 11:24:54,414 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2019-10-22 11:24:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:54,415 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-10-22 11:24:54,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-10-22 11:24:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:24:54,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:54,415 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:24:54,416 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:54,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:54,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1985844013, now seen corresponding path program 1 times [2019-10-22 11:24:54,416 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:54,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108912717] [2019-10-22 11:24:54,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:54,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108912717] [2019-10-22 11:24:54,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:54,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:54,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400448806] [2019-10-22 11:24:54,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:54,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:54,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:54,492 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2019-10-22 11:24:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:54,505 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-10-22 11:24:54,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:54,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 11:24:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:54,506 INFO L225 Difference]: With dead ends: 43 [2019-10-22 11:24:54,506 INFO L226 Difference]: Without dead ends: 30 [2019-10-22 11:24:54,507 INFO L600 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 [2019-10-22 11:24:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-22 11:24:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-22 11:24:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 11:24:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-22 11:24:54,509 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 28 [2019-10-22 11:24:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:54,509 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-22 11:24:54,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-22 11:24:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:24:54,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:54,510 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:54,510 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:24:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1042497349, now seen corresponding path program 1 times [2019-10-22 11:24:54,511 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:54,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725927472] [2019-10-22 11:24:54,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:24:54,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725927472] [2019-10-22 11:24:54,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:54,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:54,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713883763] [2019-10-22 11:24:54,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:54,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:54,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:54,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:54,605 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2019-10-22 11:24:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:54,628 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-10-22 11:24:54,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:54,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 11:24:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:54,629 INFO L225 Difference]: With dead ends: 30 [2019-10-22 11:24:54,629 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:24:54,630 INFO L600 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 [2019-10-22 11:24:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:24:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:24:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:24:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:24:54,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-10-22 11:24:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:54,631 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:24:54,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:24:54,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:24:54,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:24:55,044 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-10-22 11:24:55,044 INFO L439 ceAbstractionStarter]: At program point L1761(lines 1757 1762) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-10-22 11:24:55,044 INFO L446 ceAbstractionStarter]: At program point L1889(lines 1861 1890) the Hoare annotation is: true [2019-10-22 11:24:55,044 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-10-22 11:24:55,044 INFO L443 ceAbstractionStarter]: For program point L1873(line 1873) no Hoare annotation was computed. [2019-10-22 11:24:55,045 INFO L443 ceAbstractionStarter]: For program point L1873-1(line 1873) no Hoare annotation was computed. [2019-10-22 11:24:55,045 INFO L443 ceAbstractionStarter]: For program point L1873-2(line 1873) no Hoare annotation was computed. [2019-10-22 11:24:55,045 INFO L443 ceAbstractionStarter]: For program point L1873-3(line 1873) no Hoare annotation was computed. [2019-10-22 11:24:55,045 INFO L443 ceAbstractionStarter]: For program point L1865-2(lines 1865 1866) no Hoare annotation was computed. [2019-10-22 11:24:55,045 INFO L443 ceAbstractionStarter]: For program point L1865-3(line 1865) no Hoare annotation was computed. [2019-10-22 11:24:55,045 INFO L439 ceAbstractionStarter]: At program point L1865-4(lines 1865 1866) the Hoare annotation is: (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)) [2019-10-22 11:24:55,045 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-10-22 11:24:55,045 INFO L443 ceAbstractionStarter]: For program point L1865-5(lines 1865 1866) no Hoare annotation was computed. [2019-10-22 11:24:55,045 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-10-22 11:24:55,045 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:24:55,046 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-10-22 11:24:55,046 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:24:55,046 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:24:55,046 INFO L439 ceAbstractionStarter]: At program point L1779(lines 1777 1780) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-10-22 11:24:55,046 INFO L439 ceAbstractionStarter]: At program point L1775(lines 1766 1776) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-10-22 11:24:55,046 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-10-22 11:24:55,046 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-10-22 11:24:55,046 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-10-22 11:24:55,046 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:24:55,047 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-10-22 11:24:55,047 INFO L443 ceAbstractionStarter]: For program point L1875-2(lines 1875 1882) no Hoare annotation was computed. [2019-10-22 11:24:55,047 INFO L443 ceAbstractionStarter]: For program point L1875-3(line 1875) no Hoare annotation was computed. [2019-10-22 11:24:55,047 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-10-22 11:24:55,047 INFO L439 ceAbstractionStarter]: At program point L1875-4(lines 1875 1882) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~argc~0)) (.cse1 (<= ULTIMATE.start_main_~argc~0 10000)) (.cse2 (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~i~4 0)) (and (<= 0 (+ ULTIMATE.start_main_~j~0 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~4 2147483648)) .cse0 .cse1 .cse2))) [2019-10-22 11:24:55,047 INFO L443 ceAbstractionStarter]: For program point L1875-5(lines 1875 1882) no Hoare annotation was computed. [2019-10-22 11:24:55,047 INFO L443 ceAbstractionStarter]: For program point L1768(lines 1768 1769) no Hoare annotation was computed. [2019-10-22 11:24:55,047 INFO L443 ceAbstractionStarter]: For program point L1768-1(lines 1768 1769) no Hoare annotation was computed. [2019-10-22 11:24:55,047 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-10-22 11:24:55,051 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-10-22 11:24:55,051 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-10-22 11:24:55,051 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-10-22 11:24:55,051 INFO L443 ceAbstractionStarter]: For program point L1884-2(lines 1884 1885) no Hoare annotation was computed. [2019-10-22 11:24:55,051 INFO L443 ceAbstractionStarter]: For program point L1884-3(line 1884) no Hoare annotation was computed. [2019-10-22 11:24:55,051 INFO L439 ceAbstractionStarter]: At program point L1884-4(lines 1884 1885) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~5 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-10-22 11:24:55,051 INFO L443 ceAbstractionStarter]: For program point L1884-5(lines 1884 1885) no Hoare annotation was computed. [2019-10-22 11:24:55,052 INFO L443 ceAbstractionStarter]: For program point L1880-2(lines 1880 1881) no Hoare annotation was computed. [2019-10-22 11:24:55,052 INFO L443 ceAbstractionStarter]: For program point L1880-3(line 1880) no Hoare annotation was computed. [2019-10-22 11:24:55,052 INFO L439 ceAbstractionStarter]: At program point L1880-4(lines 1880 1881) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~4 9999) (<= 0 (+ ULTIMATE.start_main_~j~0 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~4 2147483648)) (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-10-22 11:24:55,052 INFO L443 ceAbstractionStarter]: For program point L1872(line 1872) no Hoare annotation was computed. [2019-10-22 11:24:55,052 INFO L443 ceAbstractionStarter]: For program point L1872-1(line 1872) no Hoare annotation was computed. [2019-10-22 11:24:55,052 INFO L443 ceAbstractionStarter]: For program point L1872-2(line 1872) no Hoare annotation was computed. [2019-10-22 11:24:55,052 INFO L443 ceAbstractionStarter]: For program point L1872-3(line 1872) no Hoare annotation was computed. [2019-10-22 11:24:55,052 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-10-22 11:24:55,052 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-10-22 11:24:55,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:55 BoogieIcfgContainer [2019-10-22 11:24:55,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:55,077 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:55,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:55,078 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:55,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:51" (3/4) ... [2019-10-22 11:24:55,081 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:24:55,095 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-10-22 11:24:55,096 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-10-22 11:24:55,097 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:24:55,194 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9f4dcc16-5fbf-487a-8bb3-8ec20a0dadaf/bin/utaipan/witness.graphml [2019-10-22 11:24:55,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:55,196 INFO L168 Benchmark]: Toolchain (without parser) took 5708.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 935.7 MB in the beginning and 997.1 MB in the end (delta: -61.4 MB). Peak memory consumption was 135.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:55,198 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:55,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1335.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 935.7 MB in the beginning and 969.7 MB in the end (delta: -34.1 MB). Peak memory consumption was 117.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:55,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.93 ms. Allocated memory is still 1.2 GB. Free memory was 969.7 MB in the beginning and 959.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:55,198 INFO L168 Benchmark]: Boogie Preprocessor took 82.64 ms. Allocated memory is still 1.2 GB. Free memory is still 959.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:55,199 INFO L168 Benchmark]: RCFGBuilder took 828.88 ms. Allocated memory is still 1.2 GB. Free memory was 959.0 MB in the beginning and 893.6 MB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:55,199 INFO L168 Benchmark]: TraceAbstraction took 3225.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 893.6 MB in the beginning and 1.0 GB in the end (delta: -118.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:55,199 INFO L168 Benchmark]: Witness Printer took 116.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:55,200 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1335.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 935.7 MB in the beginning and 969.7 MB in the end (delta: -34.1 MB). Peak memory consumption was 117.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.93 ms. Allocated memory is still 1.2 GB. Free memory was 969.7 MB in the beginning and 959.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.64 ms. Allocated memory is still 1.2 GB. Free memory is still 959.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 828.88 ms. Allocated memory is still 1.2 GB. Free memory was 959.0 MB in the beginning and 893.6 MB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3225.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 893.6 MB in the beginning and 1.0 GB in the end (delta: -118.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 116.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1884]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1880]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1880]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1884]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 1777]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1880]: Loop Invariant Derived loop invariant: ((((i <= 9999 && 0 <= j + 2147483648) && 0 <= i + 2147483648) && argc <= 10000) && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1884]: Loop Invariant Derived loop invariant: ((argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648) && 0 <= i + 2147483648 - InvariantResult [Line: 1757]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1861]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1766]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1875]: Loop Invariant Derived loop invariant: (((1 <= argc && argc <= 10000) && 0 <= i + 2147483648) && i == 0) || ((((0 <= j + 2147483648 && 0 <= i + 2147483648) && 1 <= argc) && argc <= 10000) && 0 <= i + 2147483648) - InvariantResult [Line: 1865]: Loop Invariant Derived loop invariant: 0 <= i + 2147483648 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 16 error locations. Result: SAFE, OverallTime: 3.1s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 484 SDtfs, 241 SDslu, 337 SDs, 0 SdLazy, 172 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 21 NumberOfFragments, 123 HoareAnnotationTreeSize, 8 FomulaSimplifications, 1073 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 166 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 8362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...