./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30f4e4ab 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_1-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 c172e82b435756efbbcf3396e72051c66081518f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-30f4e4a [2019-11-28 02:54:11,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:54:11,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:54:11,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:54:11,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:54:11,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:54:11,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:54:11,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:54:11,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:54:11,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:54:11,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:54:11,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:54:11,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:54:11,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:54:11,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:54:11,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:54:11,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:54:11,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:54:11,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:54:11,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:54:11,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:54:11,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:54:11,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:54:11,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:54:11,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:54:11,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:54:11,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:54:11,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:54:11,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:54:11,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:54:11,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:54:11,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:54:11,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:54:11,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:54:11,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:54:11,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:54:11,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:54:11,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:54:11,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:54:11,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:54:11,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:54:11,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 02:54:12,016 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:54:12,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:54:12,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:54:12,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:54:12,018 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:54:12,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:54:12,019 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:54:12,019 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:54:12,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:54:12,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:54:12,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:54:12,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:54:12,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:54:12,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:54:12,022 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:54:12,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:54:12,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:54:12,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:54:12,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:54:12,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:54:12,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:54:12,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:54:12,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:54:12,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:54:12,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:54:12,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:54:12,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:54:12,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:54:12,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:54:12,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:54:12,026 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 -> c172e82b435756efbbcf3396e72051c66081518f [2019-11-28 02:54:12,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:54:12,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:54:12,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:54:12,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:54:12,356 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:54:12,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-2.i [2019-11-28 02:54:12,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/533418c0a/625ffd91c25a46dbb2e7814a64797a87/FLAGe97483a3f [2019-11-28 02:54:12,951 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:54:12,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2019-11-28 02:54:12,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/533418c0a/625ffd91c25a46dbb2e7814a64797a87/FLAGe97483a3f [2019-11-28 02:54:13,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/533418c0a/625ffd91c25a46dbb2e7814a64797a87 [2019-11-28 02:54:13,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:54:13,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:54:13,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:54:13,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:54:13,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:54:13,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4569779c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13, skipping insertion in model container [2019-11-28 02:54:13,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:54:13,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:54:13,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:54:13,575 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:54:13,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:54:13,722 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:54:13,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13 WrapperNode [2019-11-28 02:54:13,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:54:13,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:54:13,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:54:13,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:54:13,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:54:13,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:54:13,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:54:13,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:54:13,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (1/1) ... [2019-11-28 02:54:13,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:54:13,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:54:13,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:54:13,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:54:13,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (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 02:54:13,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:54:13,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:54:14,387 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:54:14,387 INFO L297 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 02:54:14,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:14 BoogieIcfgContainer [2019-11-28 02:54:14,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:54:14,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:54:14,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:54:14,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:54:14,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:54:13" (1/3) ... [2019-11-28 02:54:14,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327ffda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:54:14, skipping insertion in model container [2019-11-28 02:54:14,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:13" (2/3) ... [2019-11-28 02:54:14,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327ffda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:54:14, skipping insertion in model container [2019-11-28 02:54:14,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:14" (3/3) ... [2019-11-28 02:54:14,402 INFO L109 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2019-11-28 02:54:14,413 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:54:14,420 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-11-28 02:54:14,433 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-11-28 02:54:14,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:54:14,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:54:14,478 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:54:14,478 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:54:14,478 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:54:14,479 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:54:14,479 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:54:14,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:54:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-28 02:54:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 02:54:14,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:14,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 02:54:14,521 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 02:54:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:14,526 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-11-28 02:54:14,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:14,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267341271] [2019-11-28 02:54:14,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:14,657 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 02:54:14,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267341271] [2019-11-28 02:54:14,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:14,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 02:54:14,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544593854] [2019-11-28 02:54:14,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 02:54:14,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:14,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 02:54:14,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 02:54:14,682 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-28 02:54:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:14,704 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-11-28 02:54:14,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 02:54:14,706 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-11-28 02:54:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:14,718 INFO L225 Difference]: With dead ends: 134 [2019-11-28 02:54:14,719 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 02:54:14,722 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 02:54:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 02:54:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 02:54:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 02:54:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-11-28 02:54:14,763 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-11-28 02:54:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:14,764 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-11-28 02:54:14,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 02:54:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-11-28 02:54:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:54:14,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:14,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:14,766 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 02:54:14,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-11-28 02:54:14,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:14,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508285386] [2019-11-28 02:54:14,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:14,874 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 02:54:14,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508285386] [2019-11-28 02:54:14,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:14,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:14,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995159303] [2019-11-28 02:54:14,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:14,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:14,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:14,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:14,879 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-11-28 02:54:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:15,101 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-11-28 02:54:15,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:15,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-28 02:54:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:15,103 INFO L225 Difference]: With dead ends: 144 [2019-11-28 02:54:15,103 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 02:54:15,105 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 02:54:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 02:54:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-11-28 02:54:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 02:54:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-11-28 02:54:15,126 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-11-28 02:54:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:15,127 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-11-28 02:54:15,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-11-28 02:54:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:54:15,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:15,130 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 02:54:15,131 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 02:54:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-11-28 02:54:15,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:15,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449431839] [2019-11-28 02:54:15,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:15,313 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 02:54:15,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449431839] [2019-11-28 02:54:15,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:15,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:54:15,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998966358] [2019-11-28 02:54:15,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:54:15,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:15,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:54:15,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:54:15,321 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 5 states. [2019-11-28 02:54:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:15,731 INFO L93 Difference]: Finished difference Result 237 states and 316 transitions. [2019-11-28 02:54:15,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:15,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 02:54:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:15,736 INFO L225 Difference]: With dead ends: 237 [2019-11-28 02:54:15,736 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 02:54:15,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:54:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 02:54:15,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 106. [2019-11-28 02:54:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 02:54:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2019-11-28 02:54:15,765 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 19 [2019-11-28 02:54:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:15,766 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2019-11-28 02:54:15,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:54:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2019-11-28 02:54:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:54:15,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:15,770 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 02:54:15,772 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 02:54:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash 630219950, now seen corresponding path program 1 times [2019-11-28 02:54:15,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:15,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147606278] [2019-11-28 02:54:15,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:54:15,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147606278] [2019-11-28 02:54:15,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:15,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:15,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196669657] [2019-11-28 02:54:15,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:15,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:15,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:15,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:15,912 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand 3 states. [2019-11-28 02:54:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:15,924 INFO L93 Difference]: Finished difference Result 171 states and 226 transitions. [2019-11-28 02:54:15,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:15,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:54:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:15,927 INFO L225 Difference]: With dead ends: 171 [2019-11-28 02:54:15,928 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 02:54:15,930 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 02:54:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 02:54:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 02:54:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 02:54:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2019-11-28 02:54:15,948 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 22 [2019-11-28 02:54:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:15,950 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2019-11-28 02:54:15,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2019-11-28 02:54:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:54:15,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:15,954 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, 1, 1, 1] [2019-11-28 02:54:15,954 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 02:54:15,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash 898692249, now seen corresponding path program 1 times [2019-11-28 02:54:15,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:15,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886758707] [2019-11-28 02:54:15,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:16,074 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 02:54:16,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886758707] [2019-11-28 02:54:16,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:16,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:16,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066050692] [2019-11-28 02:54:16,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:16,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:16,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:16,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:16,077 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand 3 states. [2019-11-28 02:54:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:16,091 INFO L93 Difference]: Finished difference Result 104 states and 138 transitions. [2019-11-28 02:54:16,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:16,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 02:54:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:16,093 INFO L225 Difference]: With dead ends: 104 [2019-11-28 02:54:16,094 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 02:54:16,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 02:54:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-28 02:54:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 02:54:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2019-11-28 02:54:16,102 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 28 [2019-11-28 02:54:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:16,103 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2019-11-28 02:54:16,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2019-11-28 02:54:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:54:16,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:16,105 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, 1, 1, 1] [2019-11-28 02:54:16,106 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 02:54:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -112425001, now seen corresponding path program 1 times [2019-11-28 02:54:16,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:16,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787872771] [2019-11-28 02:54:16,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:16,356 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 02:54:16,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787872771] [2019-11-28 02:54:16,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:16,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:54:16,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401902578] [2019-11-28 02:54:16,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:54:16,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:54:16,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:54:16,359 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 6 states. [2019-11-28 02:54:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:16,816 INFO L93 Difference]: Finished difference Result 278 states and 378 transitions. [2019-11-28 02:54:16,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:54:16,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-28 02:54:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:16,818 INFO L225 Difference]: With dead ends: 278 [2019-11-28 02:54:16,818 INFO L226 Difference]: Without dead ends: 215 [2019-11-28 02:54:16,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-28 02:54:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 129. [2019-11-28 02:54:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-28 02:54:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 164 transitions. [2019-11-28 02:54:16,830 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 164 transitions. Word has length 28 [2019-11-28 02:54:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:16,830 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 164 transitions. [2019-11-28 02:54:16,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:54:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 164 transitions. [2019-11-28 02:54:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:54:16,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:16,832 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, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:16,833 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 02:54:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:16,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1196873997, now seen corresponding path program 1 times [2019-11-28 02:54:16,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:16,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69477792] [2019-11-28 02:54:16,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:16,919 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 02:54:16,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69477792] [2019-11-28 02:54:16,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531079350] [2019-11-28 02:54:16,921 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 02:54:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:16,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:54:17,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:17,062 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 02:54:17,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:54:17,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-11-28 02:54:17,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341036992] [2019-11-28 02:54:17,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:17,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:17,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:17,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:54:17,065 INFO L87 Difference]: Start difference. First operand 129 states and 164 transitions. Second operand 4 states. [2019-11-28 02:54:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:17,322 INFO L93 Difference]: Finished difference Result 251 states and 358 transitions. [2019-11-28 02:54:17,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:17,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 02:54:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:17,324 INFO L225 Difference]: With dead ends: 251 [2019-11-28 02:54:17,325 INFO L226 Difference]: Without dead ends: 185 [2019-11-28 02:54:17,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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 02:54:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-28 02:54:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2019-11-28 02:54:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 02:54:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2019-11-28 02:54:17,336 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 31 [2019-11-28 02:54:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:17,337 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2019-11-28 02:54:17,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2019-11-28 02:54:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 02:54:17,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:17,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:17,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:17,550 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 02:54:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:17,551 INFO L82 PathProgramCache]: Analyzing trace with hash 885794486, now seen corresponding path program 1 times [2019-11-28 02:54:17,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:17,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598578869] [2019-11-28 02:54:17,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:54:17,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598578869] [2019-11-28 02:54:17,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097763637] [2019-11-28 02:54:17,785 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 02:54:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:17,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:54:17,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:54:17,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:54:17,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-11-28 02:54:17,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286572660] [2019-11-28 02:54:17,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:17,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:17,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:17,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:54:17,879 INFO L87 Difference]: Start difference. First operand 158 states and 193 transitions. Second operand 4 states. [2019-11-28 02:54:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:18,160 INFO L93 Difference]: Finished difference Result 337 states and 447 transitions. [2019-11-28 02:54:18,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:18,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-28 02:54:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:18,162 INFO L225 Difference]: With dead ends: 337 [2019-11-28 02:54:18,162 INFO L226 Difference]: Without dead ends: 227 [2019-11-28 02:54:18,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:54:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-28 02:54:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 190. [2019-11-28 02:54:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-28 02:54:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2019-11-28 02:54:18,173 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 38 [2019-11-28 02:54:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:18,174 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2019-11-28 02:54:18,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2019-11-28 02:54:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 02:54:18,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:18,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:18,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:18,381 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 02:54:18,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:18,381 INFO L82 PathProgramCache]: Analyzing trace with hash -606603049, now seen corresponding path program 1 times [2019-11-28 02:54:18,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:18,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436258360] [2019-11-28 02:54:18,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 02:54:18,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436258360] [2019-11-28 02:54:18,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537181167] [2019-11-28 02:54:18,531 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 02:54:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:18,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:54:18,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 02:54:18,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:54:18,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-11-28 02:54:18,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106065585] [2019-11-28 02:54:18,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:18,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:18,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:18,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:54:18,617 INFO L87 Difference]: Start difference. First operand 190 states and 229 transitions. Second operand 4 states. [2019-11-28 02:54:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:18,872 INFO L93 Difference]: Finished difference Result 401 states and 517 transitions. [2019-11-28 02:54:18,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:18,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 02:54:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:18,875 INFO L225 Difference]: With dead ends: 401 [2019-11-28 02:54:18,875 INFO L226 Difference]: Without dead ends: 259 [2019-11-28 02:54:18,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:54:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-28 02:54:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 222. [2019-11-28 02:54:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-28 02:54:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 265 transitions. [2019-11-28 02:54:18,885 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 265 transitions. Word has length 45 [2019-11-28 02:54:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:18,885 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 265 transitions. [2019-11-28 02:54:18,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 265 transitions. [2019-11-28 02:54:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 02:54:18,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:18,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:19,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:19,091 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 02:54:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:19,091 INFO L82 PathProgramCache]: Analyzing trace with hash 491566034, now seen corresponding path program 1 times [2019-11-28 02:54:19,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:19,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808721776] [2019-11-28 02:54:19,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 02:54:19,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808721776] [2019-11-28 02:54:19,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:19,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:19,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708480733] [2019-11-28 02:54:19,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:19,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:19,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:19,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:19,148 INFO L87 Difference]: Start difference. First operand 222 states and 265 transitions. Second operand 3 states. [2019-11-28 02:54:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:19,158 INFO L93 Difference]: Finished difference Result 259 states and 306 transitions. [2019-11-28 02:54:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:19,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 02:54:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:19,160 INFO L225 Difference]: With dead ends: 259 [2019-11-28 02:54:19,160 INFO L226 Difference]: Without dead ends: 198 [2019-11-28 02:54:19,161 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 02:54:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-28 02:54:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2019-11-28 02:54:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-28 02:54:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2019-11-28 02:54:19,166 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 52 [2019-11-28 02:54:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:19,166 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2019-11-28 02:54:19,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2019-11-28 02:54:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 02:54:19,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:19,167 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2019-11-28 02:54:19,167 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 02:54:19,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:19,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1569323720, now seen corresponding path program 1 times [2019-11-28 02:54:19,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:19,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099382577] [2019-11-28 02:54:19,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:19,284 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 02:54:19,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099382577] [2019-11-28 02:54:19,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:19,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:54:19,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320352050] [2019-11-28 02:54:19,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:19,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:19,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:19,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:19,287 INFO L87 Difference]: Start difference. First operand 177 states and 213 transitions. Second operand 4 states. [2019-11-28 02:54:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:19,378 INFO L93 Difference]: Finished difference Result 442 states and 535 transitions. [2019-11-28 02:54:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:54:19,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-28 02:54:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:19,381 INFO L225 Difference]: With dead ends: 442 [2019-11-28 02:54:19,381 INFO L226 Difference]: Without dead ends: 313 [2019-11-28 02:54:19,382 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 02:54:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-28 02:54:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 218. [2019-11-28 02:54:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-28 02:54:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 270 transitions. [2019-11-28 02:54:19,391 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 270 transitions. Word has length 61 [2019-11-28 02:54:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:19,391 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 270 transitions. [2019-11-28 02:54:19,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 270 transitions. [2019-11-28 02:54:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 02:54:19,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:19,393 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2019-11-28 02:54:19,394 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 02:54:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:19,394 INFO L82 PathProgramCache]: Analyzing trace with hash 481660278, now seen corresponding path program 2 times [2019-11-28 02:54:19,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:19,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030251167] [2019-11-28 02:54:19,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 02:54:19,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030251167] [2019-11-28 02:54:19,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596729817] [2019-11-28 02:54:19,503 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 02:54:19,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:54:19,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:54:19,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:54:19,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:19,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:54:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 02:54:19,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:54:19,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 02:54:19,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890978883] [2019-11-28 02:54:19,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:54:19,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:19,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:54:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:54:19,632 INFO L87 Difference]: Start difference. First operand 218 states and 270 transitions. Second operand 6 states. [2019-11-28 02:54:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:19,862 INFO L93 Difference]: Finished difference Result 493 states and 615 transitions. [2019-11-28 02:54:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:54:19,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-28 02:54:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:19,865 INFO L225 Difference]: With dead ends: 493 [2019-11-28 02:54:19,865 INFO L226 Difference]: Without dead ends: 323 [2019-11-28 02:54:19,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-28 02:54:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 221. [2019-11-28 02:54:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-28 02:54:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 273 transitions. [2019-11-28 02:54:19,874 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 273 transitions. Word has length 61 [2019-11-28 02:54:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:19,874 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 273 transitions. [2019-11-28 02:54:19,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:54:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 273 transitions. [2019-11-28 02:54:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 02:54:19,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:19,875 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 02:54:20,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:20,079 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 02:54:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1399599652, now seen corresponding path program 1 times [2019-11-28 02:54:20,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:20,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126660032] [2019-11-28 02:54:20,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 02:54:20,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126660032] [2019-11-28 02:54:20,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670723216] [2019-11-28 02:54:20,264 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 02:54:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:20,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:54:20,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 02:54:20,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:54:20,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 9 [2019-11-28 02:54:20,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544885611] [2019-11-28 02:54:20,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:54:20,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:20,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:54:20,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:54:20,345 INFO L87 Difference]: Start difference. First operand 221 states and 273 transitions. Second operand 9 states. [2019-11-28 02:54:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:20,720 INFO L93 Difference]: Finished difference Result 584 states and 733 transitions. [2019-11-28 02:54:20,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:54:20,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-11-28 02:54:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:20,723 INFO L225 Difference]: With dead ends: 584 [2019-11-28 02:54:20,723 INFO L226 Difference]: Without dead ends: 406 [2019-11-28 02:54:20,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:54:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-28 02:54:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 344. [2019-11-28 02:54:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-28 02:54:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 422 transitions. [2019-11-28 02:54:20,736 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 422 transitions. Word has length 67 [2019-11-28 02:54:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:20,737 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 422 transitions. [2019-11-28 02:54:20,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:54:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 422 transitions. [2019-11-28 02:54:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 02:54:20,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:20,738 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 02:54:20,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:20,942 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 02:54:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash 642833928, now seen corresponding path program 1 times [2019-11-28 02:54:20,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:20,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427985721] [2019-11-28 02:54:20,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:21,151 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 02:54:21,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427985721] [2019-11-28 02:54:21,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:21,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:54:21,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582959110] [2019-11-28 02:54:21,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:21,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:21,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:21,154 INFO L87 Difference]: Start difference. First operand 344 states and 422 transitions. Second operand 8 states. [2019-11-28 02:54:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:21,805 INFO L93 Difference]: Finished difference Result 976 states and 1208 transitions. [2019-11-28 02:54:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:54:21,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-11-28 02:54:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:21,809 INFO L225 Difference]: With dead ends: 976 [2019-11-28 02:54:21,810 INFO L226 Difference]: Without dead ends: 627 [2019-11-28 02:54:21,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:54:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-11-28 02:54:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 541. [2019-11-28 02:54:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-28 02:54:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 673 transitions. [2019-11-28 02:54:21,833 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 673 transitions. Word has length 67 [2019-11-28 02:54:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:21,833 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 673 transitions. [2019-11-28 02:54:21,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 673 transitions. [2019-11-28 02:54:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 02:54:21,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:21,836 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 02:54:21,837 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 02:54:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:21,838 INFO L82 PathProgramCache]: Analyzing trace with hash 127965796, now seen corresponding path program 1 times [2019-11-28 02:54:21,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:21,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538340354] [2019-11-28 02:54:21,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:21,932 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 02:54:21,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538340354] [2019-11-28 02:54:21,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060501289] [2019-11-28 02:54:21,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:21,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:54:21,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-28 02:54:22,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:54:22,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-11-28 02:54:22,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662915296] [2019-11-28 02:54:22,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:54:22,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:22,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:54:22,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:54:22,030 INFO L87 Difference]: Start difference. First operand 541 states and 673 transitions. Second operand 7 states. [2019-11-28 02:54:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:22,745 INFO L93 Difference]: Finished difference Result 1476 states and 1835 transitions. [2019-11-28 02:54:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:54:22,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-28 02:54:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:22,750 INFO L225 Difference]: With dead ends: 1476 [2019-11-28 02:54:22,750 INFO L226 Difference]: Without dead ends: 886 [2019-11-28 02:54:22,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:54:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-11-28 02:54:22,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 438. [2019-11-28 02:54:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-28 02:54:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 577 transitions. [2019-11-28 02:54:22,772 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 577 transitions. Word has length 73 [2019-11-28 02:54:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:22,772 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 577 transitions. [2019-11-28 02:54:22,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:54:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 577 transitions. [2019-11-28 02:54:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-28 02:54:22,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:22,774 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 02:54:22,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:22,982 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 02:54:22,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1286610050, now seen corresponding path program 1 times [2019-11-28 02:54:22,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:22,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528697776] [2019-11-28 02:54:22,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:23,101 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 02:54:23,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528697776] [2019-11-28 02:54:23,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:23,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:54:23,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028458280] [2019-11-28 02:54:23,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:54:23,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:23,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:54:23,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:54:23,103 INFO L87 Difference]: Start difference. First operand 438 states and 577 transitions. Second operand 7 states. [2019-11-28 02:54:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:23,727 INFO L93 Difference]: Finished difference Result 1486 states and 2011 transitions. [2019-11-28 02:54:23,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:54:23,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-28 02:54:23,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:23,734 INFO L225 Difference]: With dead ends: 1486 [2019-11-28 02:54:23,734 INFO L226 Difference]: Without dead ends: 1092 [2019-11-28 02:54:23,737 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 02:54:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-11-28 02:54:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 888. [2019-11-28 02:54:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-11-28 02:54:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1202 transitions. [2019-11-28 02:54:23,776 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1202 transitions. Word has length 79 [2019-11-28 02:54:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:23,777 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1202 transitions. [2019-11-28 02:54:23,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:54:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1202 transitions. [2019-11-28 02:54:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 02:54:23,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:23,779 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 02:54:23,779 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 02:54:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:23,780 INFO L82 PathProgramCache]: Analyzing trace with hash -56372555, now seen corresponding path program 1 times [2019-11-28 02:54:23,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:23,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624502254] [2019-11-28 02:54:23,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-28 02:54:23,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624502254] [2019-11-28 02:54:23,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:23,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:54:23,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565902963] [2019-11-28 02:54:23,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:54:23,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:54:23,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:54:23,921 INFO L87 Difference]: Start difference. First operand 888 states and 1202 transitions. Second operand 6 states. [2019-11-28 02:54:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:24,180 INFO L93 Difference]: Finished difference Result 2376 states and 3128 transitions. [2019-11-28 02:54:24,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:54:24,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-28 02:54:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:24,189 INFO L225 Difference]: With dead ends: 2376 [2019-11-28 02:54:24,189 INFO L226 Difference]: Without dead ends: 1512 [2019-11-28 02:54:24,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2019-11-28 02:54:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1060. [2019-11-28 02:54:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-11-28 02:54:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1382 transitions. [2019-11-28 02:54:24,232 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1382 transitions. Word has length 82 [2019-11-28 02:54:24,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:24,232 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1382 transitions. [2019-11-28 02:54:24,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:54:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1382 transitions. [2019-11-28 02:54:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 02:54:24,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:24,235 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:24,235 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 02:54:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1721162641, now seen corresponding path program 1 times [2019-11-28 02:54:24,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:24,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228637531] [2019-11-28 02:54:24,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:24,373 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 02:54:24,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228637531] [2019-11-28 02:54:24,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:24,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:54:24,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975759028] [2019-11-28 02:54:24,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:54:24,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:24,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:54:24,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:54:24,377 INFO L87 Difference]: Start difference. First operand 1060 states and 1382 transitions. Second operand 8 states. [2019-11-28 02:54:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:25,452 INFO L93 Difference]: Finished difference Result 2563 states and 3343 transitions. [2019-11-28 02:54:25,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:54:25,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-28 02:54:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:25,459 INFO L225 Difference]: With dead ends: 2563 [2019-11-28 02:54:25,460 INFO L226 Difference]: Without dead ends: 1520 [2019-11-28 02:54:25,462 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 02:54:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-11-28 02:54:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1284. [2019-11-28 02:54:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-11-28 02:54:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1669 transitions. [2019-11-28 02:54:25,506 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1669 transitions. Word has length 82 [2019-11-28 02:54:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:25,507 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 1669 transitions. [2019-11-28 02:54:25,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:54:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1669 transitions. [2019-11-28 02:54:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 02:54:25,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:25,509 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:25,510 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 02:54:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1869916981, now seen corresponding path program 1 times [2019-11-28 02:54:25,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:25,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986283611] [2019-11-28 02:54:25,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:25,673 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 02:54:25,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986283611] [2019-11-28 02:54:25,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:25,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:54:25,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730180830] [2019-11-28 02:54:25,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:54:25,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:25,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:54:25,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:54:25,676 INFO L87 Difference]: Start difference. First operand 1284 states and 1669 transitions. Second operand 9 states. [2019-11-28 02:54:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:26,597 INFO L93 Difference]: Finished difference Result 2347 states and 3046 transitions. [2019-11-28 02:54:26,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:54:26,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-11-28 02:54:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:26,602 INFO L225 Difference]: With dead ends: 2347 [2019-11-28 02:54:26,602 INFO L226 Difference]: Without dead ends: 1084 [2019-11-28 02:54:26,604 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 02:54:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2019-11-28 02:54:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 943. [2019-11-28 02:54:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-28 02:54:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1219 transitions. [2019-11-28 02:54:26,632 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1219 transitions. Word has length 84 [2019-11-28 02:54:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:26,632 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1219 transitions. [2019-11-28 02:54:26,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:54:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1219 transitions. [2019-11-28 02:54:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 02:54:26,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:26,634 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 02:54:26,635 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 02:54:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash 344699391, now seen corresponding path program 1 times [2019-11-28 02:54:26,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:26,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012680532] [2019-11-28 02:54:26,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-28 02:54:26,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012680532] [2019-11-28 02:54:26,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591218834] [2019-11-28 02:54:26,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:26,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 02:54:26,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-28 02:54:26,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:54:26,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-28 02:54:26,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347586627] [2019-11-28 02:54:26,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:54:26,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:26,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:54:26,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:54:26,983 INFO L87 Difference]: Start difference. First operand 943 states and 1219 transitions. Second operand 11 states. [2019-11-28 02:54:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:27,256 INFO L93 Difference]: Finished difference Result 1321 states and 1624 transitions. [2019-11-28 02:54:27,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:54:27,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-11-28 02:54:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:27,264 INFO L225 Difference]: With dead ends: 1321 [2019-11-28 02:54:27,264 INFO L226 Difference]: Without dead ends: 1123 [2019-11-28 02:54:27,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:54:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-28 02:54:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 841. [2019-11-28 02:54:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-11-28 02:54:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1086 transitions. [2019-11-28 02:54:27,295 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1086 transitions. Word has length 90 [2019-11-28 02:54:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:27,295 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1086 transitions. [2019-11-28 02:54:27,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:54:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1086 transitions. [2019-11-28 02:54:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 02:54:27,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:27,298 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 02:54:27,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:27,505 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 02:54:27,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:27,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1999362949, now seen corresponding path program 2 times [2019-11-28 02:54:27,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:27,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719912923] [2019-11-28 02:54:27,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 02:54:27,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719912923] [2019-11-28 02:54:27,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420832953] [2019-11-28 02:54:27,634 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:27,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:54:27,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:54:27,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 02:54:27,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 02:54:27,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:54:27,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2019-11-28 02:54:27,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863125815] [2019-11-28 02:54:27,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:54:27,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:54:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:54:27,959 INFO L87 Difference]: Start difference. First operand 841 states and 1086 transitions. Second operand 12 states. [2019-11-28 02:54:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:28,881 INFO L93 Difference]: Finished difference Result 3051 states and 3643 transitions. [2019-11-28 02:54:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:54:28,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-11-28 02:54:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:28,892 INFO L225 Difference]: With dead ends: 3051 [2019-11-28 02:54:28,892 INFO L226 Difference]: Without dead ends: 2647 [2019-11-28 02:54:28,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:54:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-11-28 02:54:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 742. [2019-11-28 02:54:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-11-28 02:54:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 964 transitions. [2019-11-28 02:54:28,927 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 964 transitions. Word has length 90 [2019-11-28 02:54:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:28,928 INFO L462 AbstractCegarLoop]: Abstraction has 742 states and 964 transitions. [2019-11-28 02:54:28,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:54:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 964 transitions. [2019-11-28 02:54:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 02:54:28,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:28,930 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:29,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:29,134 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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 02:54:29,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:29,134 INFO L82 PathProgramCache]: Analyzing trace with hash 114949769, now seen corresponding path program 1 times [2019-11-28 02:54:29,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:29,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857518451] [2019-11-28 02:54:29,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 02:54:29,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857518451] [2019-11-28 02:54:29,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857520659] [2019-11-28 02:54:29,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:29,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 02:54:29,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 24 proven. 35 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-28 02:54:29,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:54:29,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-11-28 02:54:29,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076222755] [2019-11-28 02:54:29,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:54:29,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:29,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:54:29,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:54:29,460 INFO L87 Difference]: Start difference. First operand 742 states and 964 transitions. Second operand 12 states. [2019-11-28 02:54:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:30,576 INFO L93 Difference]: Finished difference Result 2031 states and 2503 transitions. [2019-11-28 02:54:30,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:54:30,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-11-28 02:54:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:30,581 INFO L225 Difference]: With dead ends: 2031 [2019-11-28 02:54:30,581 INFO L226 Difference]: Without dead ends: 747 [2019-11-28 02:54:30,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:54:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-28 02:54:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 244. [2019-11-28 02:54:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-28 02:54:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 320 transitions. [2019-11-28 02:54:30,603 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 320 transitions. Word has length 94 [2019-11-28 02:54:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:30,604 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 320 transitions. [2019-11-28 02:54:30,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:54:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 320 transitions. [2019-11-28 02:54:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 02:54:30,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:30,606 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-28 02:54:30,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:30,812 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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 02:54:30,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:30,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1499605514, now seen corresponding path program 1 times [2019-11-28 02:54:30,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:30,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331986352] [2019-11-28 02:54:30,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:54:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:54:31,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:54:31,003 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:54:31,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:54:31 BoogieIcfgContainer [2019-11-28 02:54:31,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:54:31,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:54:31,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:54:31,076 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:54:31,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:14" (3/4) ... [2019-11-28 02:54:31,086 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 02:54:31,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:54:31,090 INFO L168 Benchmark]: Toolchain (without parser) took 17801.94 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.5 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -68.6 MB). Peak memory consumption was 276.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:31,090 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:31,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:31,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.59 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 02:54:31,097 INFO L168 Benchmark]: Boogie Preprocessor took 30.55 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 02:54:31,102 INFO L168 Benchmark]: RCFGBuilder took 585.84 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: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:31,103 INFO L168 Benchmark]: TraceAbstraction took 16682.84 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 228.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 277.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:31,103 INFO L168 Benchmark]: Witness Printer took 11.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:31,105 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 435.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.59 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 30.55 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 585.84 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: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16682.84 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 228.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 277.8 MB. Max. memory is 11.5 GB. * Witness Printer took 11.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. 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] b = __VERIFIER_nondet_uint() [L109] a = 234770789 [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 FALSE !(a3 == (unsigned char)0) [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)255) [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 TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND TRUE i == (unsigned char)1 [L66] EXPR partial_sum + a1 [L66] partial_sum = partial_sum + a1 [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [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)255) [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 TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND FALSE !(i == (unsigned char)1) [L67] COND TRUE i == (unsigned char)2 [L67] EXPR partial_sum + a2 [L67] partial_sum = partial_sum + a2 [L68] COND FALSE !(i == (unsigned char)3) [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)255) [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 TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND TRUE i == (unsigned char)3 [L68] EXPR partial_sum + a3 [L68] partial_sum = partial_sum + a3 [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)255)) [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: 16.5s, OverallIterations: 23, TraceHistogramMax: 4, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2156 SDtfs, 4074 SDslu, 5007 SDs, 0 SdLazy, 5605 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 784 GetRequests, 600 SyntacticMatches, 18 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1284occurred 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.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 4795 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1897 NumberOfCodeBlocks, 1897 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1766 ConstructedInterpolants, 19 QuantifiedInterpolants, 578378 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1334 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 1293/1483 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...