./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6af52310ec13e6e7a94146d05f9e904086453aae .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:26:42,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:26:42,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:26:42,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:26:42,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:26:42,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:26:42,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:26:42,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:26:42,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:26:42,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:26:42,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:26:42,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:26:42,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:26:42,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:26:42,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:26:42,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:26:42,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:26:42,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:26:42,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:26:42,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:26:42,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:26:42,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:26:42,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:26:42,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:26:42,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:26:42,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:26:42,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:26:42,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:26:42,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:26:42,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:26:42,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:26:42,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:26:42,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:26:42,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:26:42,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:26:42,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:26:42,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:26:42,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:26:42,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:26:42,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:26:42,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:26:42,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 20:26:42,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:26:42,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:26:42,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:26:42,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:26:42,527 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:26:42,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:26:42,527 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:26:42,527 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:26:42,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:26:42,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:26:42,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:26:42,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:26:42,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:26:42,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:26:42,529 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:26:42,529 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:26:42,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:26:42,529 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:26:42,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:26:42,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:26:42,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:26:42,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:26:42,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:26:42,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:26:42,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:26:42,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:26:42,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:26:42,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:26:42,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:26:42,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:26:42,532 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:26:42,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6af52310ec13e6e7a94146d05f9e904086453aae [2019-11-28 20:26:42,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:26:42,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:26:42,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:26:42,870 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:26:42,870 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:26:42,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-2.i [2019-11-28 20:26:42,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e347cfeb2/5c6b56647cfb4def9fc6d76120941b5e/FLAG8f3ab78d8 [2019-11-28 20:26:43,470 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:26:43,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i [2019-11-28 20:26:43,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e347cfeb2/5c6b56647cfb4def9fc6d76120941b5e/FLAG8f3ab78d8 [2019-11-28 20:26:43,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e347cfeb2/5c6b56647cfb4def9fc6d76120941b5e [2019-11-28 20:26:43,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:26:43,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:26:43,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:26:43,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:26:43,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:26:43,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:26:43" (1/1) ... [2019-11-28 20:26:43,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77cf407f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:43, skipping insertion in model container [2019-11-28 20:26:43,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:26:43" (1/1) ... [2019-11-28 20:26:43,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:26:43,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:26:44,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:26:44,072 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:26:44,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:26:44,205 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:26:44,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44 WrapperNode [2019-11-28 20:26:44,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:26:44,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:26:44,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:26:44,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:26:44,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (1/1) ... [2019-11-28 20:26:44,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (1/1) ... [2019-11-28 20:26:44,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:26:44,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:26:44,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:26:44,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:26:44,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (1/1) ... [2019-11-28 20:26:44,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (1/1) ... [2019-11-28 20:26:44,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (1/1) ... [2019-11-28 20:26:44,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (1/1) ... [2019-11-28 20:26:44,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (1/1) ... [2019-11-28 20:26:44,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (1/1) ... [2019-11-28 20:26:44,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (1/1) ... [2019-11-28 20:26:44,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:26:44,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:26:44,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:26:44,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:26:44,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:26:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:26:44,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:26:44,945 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:26:44,945 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 20:26:44,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:26:44 BoogieIcfgContainer [2019-11-28 20:26:44,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:26:44,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:26:44,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:26:44,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:26:44,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:26:43" (1/3) ... [2019-11-28 20:26:44,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123d2c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:26:44, skipping insertion in model container [2019-11-28 20:26:44,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:26:44" (2/3) ... [2019-11-28 20:26:44,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123d2c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:26:44, skipping insertion in model container [2019-11-28 20:26:44,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:26:44" (3/3) ... [2019-11-28 20:26:44,956 INFO L109 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2019-11-28 20:26:44,967 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:26:44,974 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-11-28 20:26:44,987 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-11-28 20:26:45,017 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:26:45,018 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:26:45,018 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:26:45,018 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:26:45,018 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:26:45,019 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:26:45,019 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:26:45,019 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:26:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-28 20:26:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 20:26:45,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:45,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 20:26:45,052 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:45,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-11-28 20:26:45,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:45,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753192523] [2019-11-28 20:26:45,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:45,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753192523] [2019-11-28 20:26:45,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:45,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:26:45,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927045783] [2019-11-28 20:26:45,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 20:26:45,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:45,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:26:45,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:26:45,211 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-28 20:26:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:45,239 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-11-28 20:26:45,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:26:45,240 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-11-28 20:26:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:45,253 INFO L225 Difference]: With dead ends: 134 [2019-11-28 20:26:45,253 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 20:26:45,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:26:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 20:26:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 20:26:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 20:26:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-11-28 20:26:45,314 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-11-28 20:26:45,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:45,314 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-11-28 20:26:45,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 20:26:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-11-28 20:26:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:26:45,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:45,316 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:45,317 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:45,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:45,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-11-28 20:26:45,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:45,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076961324] [2019-11-28 20:26:45,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:45,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076961324] [2019-11-28 20:26:45,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:45,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:26:45,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367665521] [2019-11-28 20:26:45,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:26:45,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:45,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:26:45,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:26:45,450 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-11-28 20:26:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:45,644 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-11-28 20:26:45,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:26:45,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-28 20:26:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:45,647 INFO L225 Difference]: With dead ends: 144 [2019-11-28 20:26:45,647 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 20:26:45,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:26:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 20:26:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-11-28 20:26:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 20:26:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-11-28 20:26:45,660 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-11-28 20:26:45,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:45,661 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-11-28 20:26:45,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:26:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-11-28 20:26:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:26:45,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:45,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:45,663 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:45,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:45,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-11-28 20:26:45,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:45,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208487486] [2019-11-28 20:26:45,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:45,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208487486] [2019-11-28 20:26:45,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:45,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:26:45,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705452480] [2019-11-28 20:26:45,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:26:45,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:45,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:26:45,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:26:45,761 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 5 states. [2019-11-28 20:26:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:46,164 INFO L93 Difference]: Finished difference Result 237 states and 316 transitions. [2019-11-28 20:26:46,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:46,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 20:26:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:46,167 INFO L225 Difference]: With dead ends: 237 [2019-11-28 20:26:46,167 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 20:26:46,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 20:26:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 106. [2019-11-28 20:26:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 20:26:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2019-11-28 20:26:46,181 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 19 [2019-11-28 20:26:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:46,182 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2019-11-28 20:26:46,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:26:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2019-11-28 20:26:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:26:46,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:46,184 INFO L410 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-11-28 20:26:46,185 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash 630219950, now seen corresponding path program 1 times [2019-11-28 20:26:46,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:46,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806171152] [2019-11-28 20:26:46,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:46,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806171152] [2019-11-28 20:26:46,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:46,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:26:46,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890321671] [2019-11-28 20:26:46,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:26:46,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:46,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:26:46,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:26:46,329 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand 5 states. [2019-11-28 20:26:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:46,709 INFO L93 Difference]: Finished difference Result 236 states and 314 transitions. [2019-11-28 20:26:46,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:46,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 20:26:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:46,714 INFO L225 Difference]: With dead ends: 236 [2019-11-28 20:26:46,714 INFO L226 Difference]: Without dead ends: 179 [2019-11-28 20:26:46,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-28 20:26:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 119. [2019-11-28 20:26:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 20:26:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2019-11-28 20:26:46,747 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 22 [2019-11-28 20:26:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:46,748 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2019-11-28 20:26:46,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:26:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2019-11-28 20:26:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:26:46,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:46,752 INFO L410 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-11-28 20:26:46,753 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:46,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:46,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1393084960, now seen corresponding path program 1 times [2019-11-28 20:26:46,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:46,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700741642] [2019-11-28 20:26:46,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:46,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700741642] [2019-11-28 20:26:46,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553115994] [2019-11-28 20:26:46,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:46,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:26:46,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:47,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:26:47,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-11-28 20:26:47,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053692451] [2019-11-28 20:26:47,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:26:47,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:47,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:26:47,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:47,007 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand 4 states. [2019-11-28 20:26:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:47,279 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2019-11-28 20:26:47,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:47,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-28 20:26:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:47,281 INFO L225 Difference]: With dead ends: 215 [2019-11-28 20:26:47,282 INFO L226 Difference]: Without dead ends: 168 [2019-11-28 20:26:47,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-28 20:26:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 144. [2019-11-28 20:26:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 20:26:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2019-11-28 20:26:47,298 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 25 [2019-11-28 20:26:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:47,298 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2019-11-28 20:26:47,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:26:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2019-11-28 20:26:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:26:47,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:47,302 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:47,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:47,506 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:47,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1548482839, now seen corresponding path program 1 times [2019-11-28 20:26:47,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:47,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461030566] [2019-11-28 20:26:47,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:47,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461030566] [2019-11-28 20:26:47,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578016898] [2019-11-28 20:26:47,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:47,692 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:26:47,695 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:26:47,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:26:47,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-11-28 20:26:47,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808566837] [2019-11-28 20:26:47,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:26:47,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:47,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:26:47,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:47,741 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand 4 states. [2019-11-28 20:26:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:48,267 INFO L93 Difference]: Finished difference Result 289 states and 390 transitions. [2019-11-28 20:26:48,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:48,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-28 20:26:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:48,270 INFO L225 Difference]: With dead ends: 289 [2019-11-28 20:26:48,270 INFO L226 Difference]: Without dead ends: 197 [2019-11-28 20:26:48,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:26:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-28 20:26:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 169. [2019-11-28 20:26:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-28 20:26:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 211 transitions. [2019-11-28 20:26:48,282 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 211 transitions. Word has length 32 [2019-11-28 20:26:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:48,283 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 211 transitions. [2019-11-28 20:26:48,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:26:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 211 transitions. [2019-11-28 20:26:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 20:26:48,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:48,285 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:48,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:48,495 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash -466613948, now seen corresponding path program 1 times [2019-11-28 20:26:48,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:48,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331979366] [2019-11-28 20:26:48,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:26:48,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331979366] [2019-11-28 20:26:48,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360640284] [2019-11-28 20:26:48,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:48,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:26:48,712 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:26:48,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:26:48,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-28 20:26:48,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471231727] [2019-11-28 20:26:48,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:26:48,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:48,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:26:48,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:26:48,772 INFO L87 Difference]: Start difference. First operand 169 states and 211 transitions. Second operand 4 states. [2019-11-28 20:26:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:49,459 INFO L93 Difference]: Finished difference Result 339 states and 446 transitions. [2019-11-28 20:26:49,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:49,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-28 20:26:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:49,463 INFO L225 Difference]: With dead ends: 339 [2019-11-28 20:26:49,464 INFO L226 Difference]: Without dead ends: 222 [2019-11-28 20:26:49,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:26:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-28 20:26:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2019-11-28 20:26:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 20:26:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 240 transitions. [2019-11-28 20:26:49,476 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 240 transitions. Word has length 39 [2019-11-28 20:26:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:49,476 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 240 transitions. [2019-11-28 20:26:49,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:26:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 240 transitions. [2019-11-28 20:26:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 20:26:49,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:49,479 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:49,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:49,686 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:49,686 INFO L82 PathProgramCache]: Analyzing trace with hash -811417915, now seen corresponding path program 1 times [2019-11-28 20:26:49,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:49,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637423032] [2019-11-28 20:26:49,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 20:26:49,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637423032] [2019-11-28 20:26:49,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:49,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:26:49,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178997964] [2019-11-28 20:26:49,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:26:49,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:49,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:26:49,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:26:49,761 INFO L87 Difference]: Start difference. First operand 194 states and 240 transitions. Second operand 3 states. [2019-11-28 20:26:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:49,773 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2019-11-28 20:26:49,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:26:49,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-28 20:26:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:49,776 INFO L225 Difference]: With dead ends: 231 [2019-11-28 20:26:49,777 INFO L226 Difference]: Without dead ends: 168 [2019-11-28 20:26:49,777 INFO L630 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-11-28 20:26:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-28 20:26:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-11-28 20:26:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-28 20:26:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2019-11-28 20:26:49,787 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 46 [2019-11-28 20:26:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:49,788 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2019-11-28 20:26:49,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:26:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2019-11-28 20:26:49,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 20:26:49,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:49,793 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:49,794 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:49,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:49,794 INFO L82 PathProgramCache]: Analyzing trace with hash 669122321, now seen corresponding path program 1 times [2019-11-28 20:26:49,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:49,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167692105] [2019-11-28 20:26:49,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-28 20:26:49,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167692105] [2019-11-28 20:26:49,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:49,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:26:49,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930128006] [2019-11-28 20:26:49,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:26:49,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:49,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:26:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:26:49,910 INFO L87 Difference]: Start difference. First operand 168 states and 206 transitions. Second operand 5 states. [2019-11-28 20:26:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:50,167 INFO L93 Difference]: Finished difference Result 464 states and 572 transitions. [2019-11-28 20:26:50,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:26:50,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-28 20:26:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:50,170 INFO L225 Difference]: With dead ends: 464 [2019-11-28 20:26:50,170 INFO L226 Difference]: Without dead ends: 346 [2019-11-28 20:26:50,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:26:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-28 20:26:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 208. [2019-11-28 20:26:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-28 20:26:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 255 transitions. [2019-11-28 20:26:50,181 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 255 transitions. Word has length 58 [2019-11-28 20:26:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:50,181 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 255 transitions. [2019-11-28 20:26:50,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:26:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 255 transitions. [2019-11-28 20:26:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 20:26:50,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:50,183 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:50,184 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2018692145, now seen corresponding path program 1 times [2019-11-28 20:26:50,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:50,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648725275] [2019-11-28 20:26:50,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 20:26:50,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648725275] [2019-11-28 20:26:50,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:50,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:26:50,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776054113] [2019-11-28 20:26:50,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:26:50,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:50,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:26:50,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:26:50,250 INFO L87 Difference]: Start difference. First operand 208 states and 255 transitions. Second operand 4 states. [2019-11-28 20:26:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:50,334 INFO L93 Difference]: Finished difference Result 464 states and 568 transitions. [2019-11-28 20:26:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:50,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-28 20:26:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:50,338 INFO L225 Difference]: With dead ends: 464 [2019-11-28 20:26:50,338 INFO L226 Difference]: Without dead ends: 306 [2019-11-28 20:26:50,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:26:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-28 20:26:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 224. [2019-11-28 20:26:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-28 20:26:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 282 transitions. [2019-11-28 20:26:50,347 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 282 transitions. Word has length 61 [2019-11-28 20:26:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:50,348 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 282 transitions. [2019-11-28 20:26:50,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:26:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 282 transitions. [2019-11-28 20:26:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 20:26:50,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:50,350 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:50,350 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:50,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1454389477, now seen corresponding path program 1 times [2019-11-28 20:26:50,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:50,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394311843] [2019-11-28 20:26:50,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 20:26:50,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394311843] [2019-11-28 20:26:50,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:50,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:26:50,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780021913] [2019-11-28 20:26:50,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:26:50,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:50,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:26:50,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:26:50,516 INFO L87 Difference]: Start difference. First operand 224 states and 282 transitions. Second operand 8 states. [2019-11-28 20:26:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:51,055 INFO L93 Difference]: Finished difference Result 673 states and 859 transitions. [2019-11-28 20:26:51,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:26:51,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-11-28 20:26:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:51,058 INFO L225 Difference]: With dead ends: 673 [2019-11-28 20:26:51,059 INFO L226 Difference]: Without dead ends: 491 [2019-11-28 20:26:51,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:26:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-11-28 20:26:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 431. [2019-11-28 20:26:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-11-28 20:26:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 545 transitions. [2019-11-28 20:26:51,079 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 545 transitions. Word has length 67 [2019-11-28 20:26:51,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:51,080 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 545 transitions. [2019-11-28 20:26:51,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:26:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 545 transitions. [2019-11-28 20:26:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 20:26:51,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:51,082 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:51,082 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2083812095, now seen corresponding path program 1 times [2019-11-28 20:26:51,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:51,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916951] [2019-11-28 20:26:51,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 20:26:51,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916951] [2019-11-28 20:26:51,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279871207] [2019-11-28 20:26:51,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:51,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:26:51,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 20:26:51,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:26:51,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 9 [2019-11-28 20:26:51,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000023318] [2019-11-28 20:26:51,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:26:51,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:51,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:26:51,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:26:51,351 INFO L87 Difference]: Start difference. First operand 431 states and 545 transitions. Second operand 4 states. [2019-11-28 20:26:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:51,516 INFO L93 Difference]: Finished difference Result 1143 states and 1435 transitions. [2019-11-28 20:26:51,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:26:51,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-28 20:26:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:51,521 INFO L225 Difference]: With dead ends: 1143 [2019-11-28 20:26:51,522 INFO L226 Difference]: Without dead ends: 721 [2019-11-28 20:26:51,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:26:51,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-11-28 20:26:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 571. [2019-11-28 20:26:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-28 20:26:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 725 transitions. [2019-11-28 20:26:51,549 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 725 transitions. Word has length 67 [2019-11-28 20:26:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:51,549 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 725 transitions. [2019-11-28 20:26:51,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:26:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 725 transitions. [2019-11-28 20:26:51,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 20:26:51,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:51,551 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:51,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:51,755 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:51,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:51,755 INFO L82 PathProgramCache]: Analyzing trace with hash 642833928, now seen corresponding path program 1 times [2019-11-28 20:26:51,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:51,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647917216] [2019-11-28 20:26:51,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 20:26:51,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647917216] [2019-11-28 20:26:51,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:51,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:26:51,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427965917] [2019-11-28 20:26:51,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:26:51,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:51,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:26:51,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:26:51,914 INFO L87 Difference]: Start difference. First operand 571 states and 725 transitions. Second operand 8 states. [2019-11-28 20:26:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:52,513 INFO L93 Difference]: Finished difference Result 1452 states and 1834 transitions. [2019-11-28 20:26:52,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:26:52,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-11-28 20:26:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:52,521 INFO L225 Difference]: With dead ends: 1452 [2019-11-28 20:26:52,521 INFO L226 Difference]: Without dead ends: 834 [2019-11-28 20:26:52,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:26:52,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-11-28 20:26:52,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 728. [2019-11-28 20:26:52,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-11-28 20:26:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 922 transitions. [2019-11-28 20:26:52,550 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 922 transitions. Word has length 67 [2019-11-28 20:26:52,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:52,551 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 922 transitions. [2019-11-28 20:26:52,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:26:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 922 transitions. [2019-11-28 20:26:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 20:26:52,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:52,554 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:52,555 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:52,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1201027011, now seen corresponding path program 1 times [2019-11-28 20:26:52,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:52,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745568758] [2019-11-28 20:26:52,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 20:26:52,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745568758] [2019-11-28 20:26:52,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000898047] [2019-11-28 20:26:52,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:52,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:26:52,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:26:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-28 20:26:52,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:26:52,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-28 20:26:52,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253408840] [2019-11-28 20:26:52,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:26:52,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:52,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:26:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:26:52,853 INFO L87 Difference]: Start difference. First operand 728 states and 922 transitions. Second operand 7 states. [2019-11-28 20:26:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:53,974 INFO L93 Difference]: Finished difference Result 4208 states and 5218 transitions. [2019-11-28 20:26:53,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 20:26:53,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-28 20:26:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:53,993 INFO L225 Difference]: With dead ends: 4208 [2019-11-28 20:26:53,993 INFO L226 Difference]: Without dead ends: 3406 [2019-11-28 20:26:53,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:26:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2019-11-28 20:26:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 1667. [2019-11-28 20:26:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1667 states. [2019-11-28 20:26:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2302 transitions. [2019-11-28 20:26:54,089 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2302 transitions. Word has length 73 [2019-11-28 20:26:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:54,090 INFO L462 AbstractCegarLoop]: Abstraction has 1667 states and 2302 transitions. [2019-11-28 20:26:54,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:26:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2302 transitions. [2019-11-28 20:26:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-28 20:26:54,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:54,100 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:54,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:26:54,304 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:54,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:54,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1090909143, now seen corresponding path program 1 times [2019-11-28 20:26:54,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:54,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227870319] [2019-11-28 20:26:54,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-28 20:26:54,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227870319] [2019-11-28 20:26:54,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:54,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:26:54,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547331383] [2019-11-28 20:26:54,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:26:54,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:26:54,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:26:54,468 INFO L87 Difference]: Start difference. First operand 1667 states and 2302 transitions. Second operand 7 states. [2019-11-28 20:26:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:55,152 INFO L93 Difference]: Finished difference Result 5333 states and 7297 transitions. [2019-11-28 20:26:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:26:55,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-28 20:26:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:55,170 INFO L225 Difference]: With dead ends: 5333 [2019-11-28 20:26:55,171 INFO L226 Difference]: Without dead ends: 3444 [2019-11-28 20:26:55,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:26:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2019-11-28 20:26:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3114. [2019-11-28 20:26:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2019-11-28 20:26:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4234 transitions. [2019-11-28 20:26:55,284 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4234 transitions. Word has length 79 [2019-11-28 20:26:55,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:55,284 INFO L462 AbstractCegarLoop]: Abstraction has 3114 states and 4234 transitions. [2019-11-28 20:26:55,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:26:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4234 transitions. [2019-11-28 20:26:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-28 20:26:55,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:55,288 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:55,288 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1286610050, now seen corresponding path program 1 times [2019-11-28 20:26:55,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:55,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787404527] [2019-11-28 20:26:55,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-28 20:26:55,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787404527] [2019-11-28 20:26:55,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:55,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:26:55,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747267502] [2019-11-28 20:26:55,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:26:55,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:55,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:26:55,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:26:55,424 INFO L87 Difference]: Start difference. First operand 3114 states and 4234 transitions. Second operand 7 states. [2019-11-28 20:26:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:56,214 INFO L93 Difference]: Finished difference Result 5900 states and 7876 transitions. [2019-11-28 20:26:56,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:26:56,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-28 20:26:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:56,232 INFO L225 Difference]: With dead ends: 5900 [2019-11-28 20:26:56,233 INFO L226 Difference]: Without dead ends: 3834 [2019-11-28 20:26:56,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:26:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2019-11-28 20:26:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3689. [2019-11-28 20:26:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3689 states. [2019-11-28 20:26:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 4985 transitions. [2019-11-28 20:26:56,349 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 4985 transitions. Word has length 79 [2019-11-28 20:26:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:56,349 INFO L462 AbstractCegarLoop]: Abstraction has 3689 states and 4985 transitions. [2019-11-28 20:26:56,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:26:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 4985 transitions. [2019-11-28 20:26:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 20:26:56,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:56,354 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:56,354 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:56,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:56,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2026749083, now seen corresponding path program 1 times [2019-11-28 20:26:56,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:56,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831196540] [2019-11-28 20:26:56,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-28 20:26:56,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831196540] [2019-11-28 20:26:56,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:56,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:26:56,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431580667] [2019-11-28 20:26:56,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:26:56,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:56,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:26:56,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:26:56,547 INFO L87 Difference]: Start difference. First operand 3689 states and 4985 transitions. Second operand 8 states. [2019-11-28 20:26:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:57,670 INFO L93 Difference]: Finished difference Result 8371 states and 11243 transitions. [2019-11-28 20:26:57,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:26:57,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-28 20:26:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:57,691 INFO L225 Difference]: With dead ends: 8371 [2019-11-28 20:26:57,692 INFO L226 Difference]: Without dead ends: 4434 [2019-11-28 20:26:57,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:26:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2019-11-28 20:26:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 4255. [2019-11-28 20:26:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4255 states. [2019-11-28 20:26:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5701 transitions. [2019-11-28 20:26:57,820 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5701 transitions. Word has length 82 [2019-11-28 20:26:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:57,821 INFO L462 AbstractCegarLoop]: Abstraction has 4255 states and 5701 transitions. [2019-11-28 20:26:57,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:26:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5701 transitions. [2019-11-28 20:26:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 20:26:57,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:57,825 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:57,826 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:57,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:57,826 INFO L82 PathProgramCache]: Analyzing trace with hash -56372555, now seen corresponding path program 1 times [2019-11-28 20:26:57,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:57,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561403007] [2019-11-28 20:26:57,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-28 20:26:58,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561403007] [2019-11-28 20:26:58,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:58,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:26:58,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116133056] [2019-11-28 20:26:58,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:26:58,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:26:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:26:58,014 INFO L87 Difference]: Start difference. First operand 4255 states and 5701 transitions. Second operand 8 states. [2019-11-28 20:26:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:26:59,137 INFO L93 Difference]: Finished difference Result 7575 states and 10086 transitions. [2019-11-28 20:26:59,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:26:59,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-28 20:26:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:26:59,160 INFO L225 Difference]: With dead ends: 7575 [2019-11-28 20:26:59,160 INFO L226 Difference]: Without dead ends: 4976 [2019-11-28 20:26:59,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:26:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2019-11-28 20:26:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 4724. [2019-11-28 20:26:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-11-28 20:26:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 6305 transitions. [2019-11-28 20:26:59,335 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 6305 transitions. Word has length 82 [2019-11-28 20:26:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:26:59,335 INFO L462 AbstractCegarLoop]: Abstraction has 4724 states and 6305 transitions. [2019-11-28 20:26:59,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:26:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 6305 transitions. [2019-11-28 20:26:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 20:26:59,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:26:59,341 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:26:59,341 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:26:59,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:26:59,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1381975007, now seen corresponding path program 1 times [2019-11-28 20:26:59,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:26:59,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992699811] [2019-11-28 20:26:59,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:26:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:26:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-28 20:26:59,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992699811] [2019-11-28 20:26:59,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:26:59,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:26:59,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531757954] [2019-11-28 20:26:59,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:26:59,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:26:59,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:26:59,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:26:59,496 INFO L87 Difference]: Start difference. First operand 4724 states and 6305 transitions. Second operand 9 states. [2019-11-28 20:27:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:00,601 INFO L93 Difference]: Finished difference Result 5701 states and 7556 transitions. [2019-11-28 20:27:00,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:27:00,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-11-28 20:27:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:00,615 INFO L225 Difference]: With dead ends: 5701 [2019-11-28 20:27:00,615 INFO L226 Difference]: Without dead ends: 3342 [2019-11-28 20:27:00,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:27:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2019-11-28 20:27:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 3188. [2019-11-28 20:27:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-11-28 20:27:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 4192 transitions. [2019-11-28 20:27:00,692 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 4192 transitions. Word has length 84 [2019-11-28 20:27:00,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:00,692 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 4192 transitions. [2019-11-28 20:27:00,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:27:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 4192 transitions. [2019-11-28 20:27:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 20:27:00,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:00,696 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:00,696 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:00,697 INFO L82 PathProgramCache]: Analyzing trace with hash -205126895, now seen corresponding path program 1 times [2019-11-28 20:27:00,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:00,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336925176] [2019-11-28 20:27:00,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-28 20:27:00,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336925176] [2019-11-28 20:27:00,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:00,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:27:00,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113123743] [2019-11-28 20:27:00,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:27:00,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:00,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:27:00,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:27:00,840 INFO L87 Difference]: Start difference. First operand 3188 states and 4192 transitions. Second operand 9 states. [2019-11-28 20:27:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:01,818 INFO L93 Difference]: Finished difference Result 4175 states and 5459 transitions. [2019-11-28 20:27:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:27:01,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-11-28 20:27:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:01,835 INFO L225 Difference]: With dead ends: 4175 [2019-11-28 20:27:01,837 INFO L226 Difference]: Without dead ends: 1834 [2019-11-28 20:27:01,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:27:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-11-28 20:27:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1772. [2019-11-28 20:27:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2019-11-28 20:27:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2299 transitions. [2019-11-28 20:27:01,884 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2299 transitions. Word has length 84 [2019-11-28 20:27:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:01,885 INFO L462 AbstractCegarLoop]: Abstraction has 1772 states and 2299 transitions. [2019-11-28 20:27:01,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:27:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2299 transitions. [2019-11-28 20:27:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 20:27:01,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:01,888 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:01,888 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:01,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:01,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1356500467, now seen corresponding path program 1 times [2019-11-28 20:27:01,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:01,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390371337] [2019-11-28 20:27:01,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:27:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:27:02,026 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:27:02,027 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:27:02,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:27:02 BoogieIcfgContainer [2019-11-28 20:27:02,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:27:02,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:27:02,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:27:02,111 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:27:02,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:26:44" (3/4) ... [2019-11-28 20:27:02,117 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:27:02,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:27:02,131 INFO L168 Benchmark]: Toolchain (without parser) took 18319.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 364.9 MB). Free memory was 960.4 MB in the beginning and 908.1 MB in the end (delta: 52.3 MB). Peak memory consumption was 417.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:02,132 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:02,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:02,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:02,134 INFO L168 Benchmark]: Boogie Preprocessor took 33.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:02,134 INFO L168 Benchmark]: RCFGBuilder took 651.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:02,135 INFO L168 Benchmark]: TraceAbstraction took 17161.39 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 254.8 MB). Free memory was 1.1 GB in the beginning and 908.1 MB in the end (delta: 153.3 MB). Peak memory consumption was 408.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:02,141 INFO L168 Benchmark]: Witness Printer took 7.08 ms. Allocated memory is still 1.4 GB. Free memory is still 908.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:02,149 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 651.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17161.39 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 254.8 MB). Free memory was 1.1 GB in the beginning and 908.1 MB in the end (delta: 153.3 MB). Peak memory consumption was 408.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.08 ms. Allocated memory is still 1.4 GB. Free memory is still 908.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 [L40] COND TRUE a3 == (unsigned char)0 [L41] EXPR na - 1 [L41] na = na - 1 [L42] COND TRUE a2 == (unsigned char)0 [L43] EXPR na - 1 [L43] na = na - 1 [L44] COND TRUE a1 == (unsigned char)0 [L45] EXPR na - 1 [L45] na = na - 1 [L49] nb = (unsigned char)4 [L50] COND FALSE !(b3 == (unsigned char)0) [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND TRUE i == (unsigned char)0 [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND TRUE i == (unsigned char)0 [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND TRUE i == (unsigned char)1 [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND TRUE i == (unsigned char)2 [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND TRUE i == (unsigned char)3 [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 [L76] COND FALSE !(partial_sum > ((unsigned char)254)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L88] COND FALSE !(i < (unsigned char)4) [L97] r1 << 8U [L97] r2 << 16U [L97] r3 << 24U - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 38 error locations. Result: UNSAFE, OverallTime: 17.0s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2242 SDtfs, 4537 SDslu, 5149 SDs, 0 SdLazy, 6243 SolverSat, 496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 274 SyntacticMatches, 18 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4724occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 3608 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1407 NumberOfCodeBlocks, 1407 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1292 ConstructedInterpolants, 3 QuantifiedInterpolants, 297277 SizeOfPredicates, 7 NumberOfNonLiveVariables, 577 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 1128/1188 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...