./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/bitvector/byte_add_2_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/bitvector/byte_add_2_false-no-overflow.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 758587bcbf021ce28de3aa106c09f74804dbda1d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-14 01:57:32,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:57:32,129 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:57:32,148 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:57:32,148 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:57:32,149 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:57:32,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:57:32,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:57:32,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:57:32,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:57:32,163 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:57:32,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:57:32,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:57:32,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:57:32,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:57:32,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:57:32,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:57:32,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:57:32,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:57:32,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:57:32,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:57:32,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:57:32,197 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:57:32,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:57:32,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:57:32,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:57:32,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:57:32,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:57:32,202 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:57:32,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:57:32,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:57:32,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:57:32,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:57:32,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:57:32,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:57:32,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:57:32,212 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-14 01:57:32,247 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:57:32,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:57:32,249 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:57:32,249 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:57:32,249 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:57:32,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:57:32,249 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 01:57:32,250 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:57:32,250 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:57:32,250 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 01:57:32,250 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:57:32,250 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:57:32,251 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:57:32,251 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:57:32,251 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:57:32,251 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 01:57:32,251 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:57:32,251 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:57:32,252 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:57:32,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:57:32,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:57:32,252 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:57:32,252 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:57:32,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:57:32,255 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:57:32,255 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:57:32,255 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:57:32,255 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:57:32,255 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:57:32,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:57:32,256 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 758587bcbf021ce28de3aa106c09f74804dbda1d [2019-01-14 01:57:32,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:57:32,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:57:32,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:57:32,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:57:32,330 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:57:32,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_2_false-no-overflow.i [2019-01-14 01:57:32,406 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32716fc7d/ed1935f931234e32a6ae7edb8bc7deea/FLAGf9f3fe38a [2019-01-14 01:57:32,859 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:57:32,860 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_2_false-no-overflow.i [2019-01-14 01:57:32,871 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32716fc7d/ed1935f931234e32a6ae7edb8bc7deea/FLAGf9f3fe38a [2019-01-14 01:57:33,213 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32716fc7d/ed1935f931234e32a6ae7edb8bc7deea [2019-01-14 01:57:33,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:57:33,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:57:33,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:57:33,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:57:33,227 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:57:33,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58231498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33, skipping insertion in model container [2019-01-14 01:57:33,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:57:33,287 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:57:33,583 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:57:33,590 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:57:33,635 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:57:33,662 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:57:33,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33 WrapperNode [2019-01-14 01:57:33,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:57:33,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:57:33,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:57:33,665 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:57:33,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:57:33,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:57:33,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:57:33,726 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:57:33,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:57:33,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:57:33,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:57:33,867 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:57:33,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (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-01-14 01:57:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:57:33,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:57:35,031 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:57:35,031 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-14 01:57:35,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:57:35 BoogieIcfgContainer [2019-01-14 01:57:35,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:57:35,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:57:35,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:57:35,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:57:35,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:57:33" (1/3) ... [2019-01-14 01:57:35,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720cd1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:57:35, skipping insertion in model container [2019-01-14 01:57:35,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33" (2/3) ... [2019-01-14 01:57:35,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720cd1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:57:35, skipping insertion in model container [2019-01-14 01:57:35,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:57:35" (3/3) ... [2019-01-14 01:57:35,045 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2_false-no-overflow.i [2019-01-14 01:57:35,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:57:35,072 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-01-14 01:57:35,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-01-14 01:57:35,144 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:57:35,145 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:57:35,145 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:57:35,146 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:57:35,147 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:57:35,147 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:57:35,147 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:57:35,148 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:57:35,148 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:57:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-14 01:57:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-14 01:57:35,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:35,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-14 01:57:35,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:35,196 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-01-14 01:57:35,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:35,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:35,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:35,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:57:35,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:35,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:57:35,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 01:57:35,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 01:57:35,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 01:57:35,397 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-14 01:57:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:35,435 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-01-14 01:57:35,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 01:57:35,437 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-01-14 01:57:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:35,456 INFO L225 Difference]: With dead ends: 134 [2019-01-14 01:57:35,457 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 01:57:35,462 INFO L631 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-01-14 01:57:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 01:57:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 01:57:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 01:57:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-01-14 01:57:35,534 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-01-14 01:57:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:35,534 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-01-14 01:57:35,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 01:57:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-01-14 01:57:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:57:35,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:35,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:35,539 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-01-14 01:57:35,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:35,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:35,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:35,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:35,890 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-14 01:57:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:57:35,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:35,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:57:35,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:57:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:57:35,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:35,944 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-01-14 01:57:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:36,266 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-01-14 01:57:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:57:36,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 01:57:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:36,269 INFO L225 Difference]: With dead ends: 144 [2019-01-14 01:57:36,270 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 01:57:36,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 01:57:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-01-14 01:57:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 01:57:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-01-14 01:57:36,285 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-01-14 01:57:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:36,286 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-01-14 01:57:36,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:57:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-01-14 01:57:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 01:57:36,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:36,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:36,290 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-01-14 01:57:36,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:36,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:36,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:36,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:36,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:57:36,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:36,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:36,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:57:36,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:57:36,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:57:36,481 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 4 states. [2019-01-14 01:57:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:37,583 INFO L93 Difference]: Finished difference Result 213 states and 316 transitions. [2019-01-14 01:57:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:57:37,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-14 01:57:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:37,587 INFO L225 Difference]: With dead ends: 213 [2019-01-14 01:57:37,587 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 01:57:37,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 01:57:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 118. [2019-01-14 01:57:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 01:57:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 160 transitions. [2019-01-14 01:57:37,605 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 160 transitions. Word has length 19 [2019-01-14 01:57:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:37,605 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 160 transitions. [2019-01-14 01:57:37,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:57:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 160 transitions. [2019-01-14 01:57:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 01:57:37,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:37,607 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:37,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:37,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:37,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1023692700, now seen corresponding path program 1 times [2019-01-14 01:57:37,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:37,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:37,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:37,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:37,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 01:57:37,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:37,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:37,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:57:37,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:57:37,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:57:37,798 INFO L87 Difference]: Start difference. First operand 118 states and 160 transitions. Second operand 4 states. [2019-01-14 01:57:38,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:38,206 INFO L93 Difference]: Finished difference Result 313 states and 446 transitions. [2019-01-14 01:57:38,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:57:38,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-01-14 01:57:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:38,211 INFO L225 Difference]: With dead ends: 313 [2019-01-14 01:57:38,211 INFO L226 Difference]: Without dead ends: 221 [2019-01-14 01:57:38,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-01-14 01:57:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 157. [2019-01-14 01:57:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-14 01:57:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 221 transitions. [2019-01-14 01:57:38,238 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 221 transitions. Word has length 26 [2019-01-14 01:57:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:38,239 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 221 transitions. [2019-01-14 01:57:38,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:57:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 221 transitions. [2019-01-14 01:57:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 01:57:38,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:38,245 INFO L402 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] [2019-01-14 01:57:38,246 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:38,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:38,247 INFO L82 PathProgramCache]: Analyzing trace with hash -421998743, now seen corresponding path program 1 times [2019-01-14 01:57:38,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:38,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:38,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:38,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:38,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 01:57:38,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:38,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:38,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:57:38,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:57:38,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:38,429 INFO L87 Difference]: Start difference. First operand 157 states and 221 transitions. Second operand 5 states. [2019-01-14 01:57:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:39,467 INFO L93 Difference]: Finished difference Result 454 states and 637 transitions. [2019-01-14 01:57:39,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:57:39,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-14 01:57:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:39,471 INFO L225 Difference]: With dead ends: 454 [2019-01-14 01:57:39,471 INFO L226 Difference]: Without dead ends: 321 [2019-01-14 01:57:39,473 INFO L631 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-01-14 01:57:39,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-14 01:57:39,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 170. [2019-01-14 01:57:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-14 01:57:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 237 transitions. [2019-01-14 01:57:39,490 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 237 transitions. Word has length 33 [2019-01-14 01:57:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:39,490 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 237 transitions. [2019-01-14 01:57:39,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:57:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 237 transitions. [2019-01-14 01:57:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 01:57:39,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:39,496 INFO L402 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] [2019-01-14 01:57:39,498 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:39,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:39,498 INFO L82 PathProgramCache]: Analyzing trace with hash 337056594, now seen corresponding path program 1 times [2019-01-14 01:57:39,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:39,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:39,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:39,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:39,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 01:57:39,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:39,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:57:39,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:57:39,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:57:39,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:39,612 INFO L87 Difference]: Start difference. First operand 170 states and 237 transitions. Second operand 5 states. [2019-01-14 01:57:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:40,247 INFO L93 Difference]: Finished difference Result 460 states and 643 transitions. [2019-01-14 01:57:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:57:40,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-14 01:57:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:40,250 INFO L225 Difference]: With dead ends: 460 [2019-01-14 01:57:40,251 INFO L226 Difference]: Without dead ends: 327 [2019-01-14 01:57:40,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:57:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-01-14 01:57:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 183. [2019-01-14 01:57:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-14 01:57:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 251 transitions. [2019-01-14 01:57:40,265 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 251 transitions. Word has length 36 [2019-01-14 01:57:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:40,267 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 251 transitions. [2019-01-14 01:57:40,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:57:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 251 transitions. [2019-01-14 01:57:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 01:57:40,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:40,268 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:40,271 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:40,272 INFO L82 PathProgramCache]: Analyzing trace with hash -466613948, now seen corresponding path program 1 times [2019-01-14 01:57:40,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:40,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:40,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:40,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:40,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:40,537 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-14 01:57:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 01:57:40,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:40,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:57:40,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:57:40,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:57:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:40,548 INFO L87 Difference]: Start difference. First operand 183 states and 251 transitions. Second operand 3 states. [2019-01-14 01:57:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:40,564 INFO L93 Difference]: Finished difference Result 314 states and 438 transitions. [2019-01-14 01:57:40,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:57:40,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-14 01:57:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:40,567 INFO L225 Difference]: With dead ends: 314 [2019-01-14 01:57:40,567 INFO L226 Difference]: Without dead ends: 158 [2019-01-14 01:57:40,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-14 01:57:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-01-14 01:57:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-14 01:57:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 218 transitions. [2019-01-14 01:57:40,579 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 218 transitions. Word has length 39 [2019-01-14 01:57:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:40,579 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 218 transitions. [2019-01-14 01:57:40,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:57:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 218 transitions. [2019-01-14 01:57:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 01:57:40,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:40,583 INFO L402 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-01-14 01:57:40,584 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:40,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1214279088, now seen corresponding path program 1 times [2019-01-14 01:57:40,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:40,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:40,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:40,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:40,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 01:57:40,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:40,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:57:40,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:57:40,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:57:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:40,708 INFO L87 Difference]: Start difference. First operand 158 states and 218 transitions. Second operand 3 states. [2019-01-14 01:57:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:40,774 INFO L93 Difference]: Finished difference Result 215 states and 298 transitions. [2019-01-14 01:57:40,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:57:40,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-01-14 01:57:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:40,781 INFO L225 Difference]: With dead ends: 215 [2019-01-14 01:57:40,781 INFO L226 Difference]: Without dead ends: 185 [2019-01-14 01:57:40,782 INFO L631 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-01-14 01:57:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-14 01:57:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-14 01:57:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-14 01:57:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 256 transitions. [2019-01-14 01:57:40,793 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 256 transitions. Word has length 45 [2019-01-14 01:57:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:40,795 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 256 transitions. [2019-01-14 01:57:40,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:57:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 256 transitions. [2019-01-14 01:57:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 01:57:40,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:40,798 INFO L402 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-01-14 01:57:40,800 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1723752178, now seen corresponding path program 1 times [2019-01-14 01:57:40,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:40,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:40,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:40,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:40,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 01:57:40,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:40,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:40,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:57:40,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:57:40,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:57:40,955 INFO L87 Difference]: Start difference. First operand 185 states and 256 transitions. Second operand 4 states. [2019-01-14 01:57:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:41,078 INFO L93 Difference]: Finished difference Result 371 states and 527 transitions. [2019-01-14 01:57:41,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:57:41,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-14 01:57:41,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:41,082 INFO L225 Difference]: With dead ends: 371 [2019-01-14 01:57:41,082 INFO L226 Difference]: Without dead ends: 208 [2019-01-14 01:57:41,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-14 01:57:41,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 152. [2019-01-14 01:57:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-14 01:57:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 209 transitions. [2019-01-14 01:57:41,093 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 209 transitions. Word has length 45 [2019-01-14 01:57:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:41,095 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 209 transitions. [2019-01-14 01:57:41,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:57:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 209 transitions. [2019-01-14 01:57:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 01:57:41,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:41,098 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1] [2019-01-14 01:57:41,099 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:41,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:41,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1758598464, now seen corresponding path program 1 times [2019-01-14 01:57:41,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:41,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:41,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:41,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:41,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:41,475 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 5 [2019-01-14 01:57:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 01:57:41,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:41,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:57:41,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:41,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 01:57:41,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:57:41,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2019-01-14 01:57:41,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:57:41,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:57:41,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:57:41,845 INFO L87 Difference]: Start difference. First operand 152 states and 209 transitions. Second operand 8 states. [2019-01-14 01:57:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:44,849 INFO L93 Difference]: Finished difference Result 526 states and 740 transitions. [2019-01-14 01:57:44,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:57:44,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-01-14 01:57:44,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:44,859 INFO L225 Difference]: With dead ends: 526 [2019-01-14 01:57:44,859 INFO L226 Difference]: Without dead ends: 365 [2019-01-14 01:57:44,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-01-14 01:57:44,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-01-14 01:57:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 238. [2019-01-14 01:57:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-14 01:57:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 320 transitions. [2019-01-14 01:57:44,877 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 320 transitions. Word has length 63 [2019-01-14 01:57:44,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:44,877 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 320 transitions. [2019-01-14 01:57:44,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:57:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 320 transitions. [2019-01-14 01:57:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 01:57:44,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:44,881 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 01:57:44,883 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:44,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:44,884 INFO L82 PathProgramCache]: Analyzing trace with hash 837363559, now seen corresponding path program 1 times [2019-01-14 01:57:44,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:44,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:44,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:44,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:44,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:45,389 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-01-14 01:57:45,711 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-14 01:57:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 01:57:45,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:45,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:57:45,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:45,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 01:57:46,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:57:46,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-01-14 01:57:46,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:57:46,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:57:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:57:46,049 INFO L87 Difference]: Start difference. First operand 238 states and 320 transitions. Second operand 10 states. [2019-01-14 01:57:46,496 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2019-01-14 01:57:47,951 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 01:57:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:48,633 INFO L93 Difference]: Finished difference Result 1275 states and 1648 transitions. [2019-01-14 01:57:48,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 01:57:48,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2019-01-14 01:57:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:48,643 INFO L225 Difference]: With dead ends: 1275 [2019-01-14 01:57:48,644 INFO L226 Difference]: Without dead ends: 1028 [2019-01-14 01:57:48,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2019-01-14 01:57:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-01-14 01:57:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 368. [2019-01-14 01:57:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-01-14 01:57:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 518 transitions. [2019-01-14 01:57:48,672 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 518 transitions. Word has length 79 [2019-01-14 01:57:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:48,672 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 518 transitions. [2019-01-14 01:57:48,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:57:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 518 transitions. [2019-01-14 01:57:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-14 01:57:48,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:48,676 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:48,677 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:48,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:48,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2094130365, now seen corresponding path program 1 times [2019-01-14 01:57:48,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:48,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:48,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:48,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:48,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 01:57:49,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:49,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:57:49,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:49,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 01:57:49,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:57:49,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2019-01-14 01:57:49,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:57:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:57:49,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:57:49,297 INFO L87 Difference]: Start difference. First operand 368 states and 518 transitions. Second operand 8 states. [2019-01-14 01:57:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:50,718 INFO L93 Difference]: Finished difference Result 1070 states and 1466 transitions. [2019-01-14 01:57:50,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:57:50,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-01-14 01:57:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:50,725 INFO L225 Difference]: With dead ends: 1070 [2019-01-14 01:57:50,725 INFO L226 Difference]: Without dead ends: 474 [2019-01-14 01:57:50,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:57:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-01-14 01:57:50,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 439. [2019-01-14 01:57:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-01-14 01:57:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 599 transitions. [2019-01-14 01:57:50,753 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 599 transitions. Word has length 85 [2019-01-14 01:57:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:50,753 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 599 transitions. [2019-01-14 01:57:50,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:57:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 599 transitions. [2019-01-14 01:57:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 01:57:50,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:50,759 INFO L402 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-01-14 01:57:50,761 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1499605514, now seen corresponding path program 1 times [2019-01-14 01:57:50,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:50,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:50,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:50,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 01:57:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 01:57:51,016 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 01:57:51,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:57:51 BoogieIcfgContainer [2019-01-14 01:57:51,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:57:51,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:57:51,115 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:57:51,117 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:57:51,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:57:35" (3/4) ... [2019-01-14 01:57:51,126 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 01:57:51,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:57:51,131 INFO L168 Benchmark]: Toolchain (without parser) took 17911.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.3 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -276.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:57:51,134 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:57:51,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.70 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 01:57:51,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.94 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:57:51,140 INFO L168 Benchmark]: Boogie Preprocessor took 139.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:57:51,141 INFO L168 Benchmark]: RCFGBuilder took 1166.38 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:57:51,143 INFO L168 Benchmark]: TraceAbstraction took 16080.62 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -178.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:57:51,145 INFO L168 Benchmark]: Witness Printer took 13.44 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:57:51,152 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 442.70 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.94 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 139.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1166.38 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16080.62 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -178.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 13.44 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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; [L106] a = __VERIFIER_nondet_uint() [L108] b = 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. UNSAFE Result, 15.9s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1028 SDtfs, 1645 SDslu, 1633 SDs, 0 SdLazy, 1862 SolverSat, 259 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 259 SyntacticMatches, 11 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=439occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1289 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 812 NumberOfCodeBlocks, 812 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 697 ConstructedInterpolants, 50 QuantifiedInterpolants, 266845 SizeOfPredicates, 5 NumberOfNonLiveVariables, 493 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 481/544 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...