./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer --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 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:50:11,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:50:11,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:50:11,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:50:11,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:50:11,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:50:11,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:50:11,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:50:11,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:50:11,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:50:11,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:50:11,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:50:11,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:50:11,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:50:11,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:50:11,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:50:11,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:50:11,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:50:11,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:50:11,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:50:11,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:50:11,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:50:11,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:50:11,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:50:11,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:50:11,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:50:11,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:50:11,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:50:11,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:50:11,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:50:11,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:50:11,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:50:11,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:50:11,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:50:11,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:50:11,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:50:11,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:50:11,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:50:11,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:50:11,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:50:11,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:50:11,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-12-07 18:50:11,229 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:50:11,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:50:11,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:50:11,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:50:11,230 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:50:11,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:50:11,230 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:50:11,230 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:50:11,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:50:11,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:50:11,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:50:11,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:50:11,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:50:11,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:50:11,231 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 18:50:11,231 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:50:11,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:50:11,232 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:50:11,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:50:11,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:50:11,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:50:11,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:50:11,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:50:11,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:50:11,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:50:11,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:50:11,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:50:11,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:50:11,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:50:11,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:50:11,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:50:11,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer 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 -> 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 [2019-12-07 18:50:11,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:50:11,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:50:11,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:50:11,345 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:50:11,346 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:50:11,346 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-12-07 18:50:11,389 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/data/6c48ed273/cdf355c7135d448988bf42025c9406dc/FLAG7dd39fb0f [2019-12-07 18:50:11,815 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:50:11,816 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-12-07 18:50:11,821 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/data/6c48ed273/cdf355c7135d448988bf42025c9406dc/FLAG7dd39fb0f [2019-12-07 18:50:11,832 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/data/6c48ed273/cdf355c7135d448988bf42025c9406dc [2019-12-07 18:50:11,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:50:11,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:50:11,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:50:11,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:50:11,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:50:11,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:50:11" (1/1) ... [2019-12-07 18:50:11,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45cae324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:11, skipping insertion in model container [2019-12-07 18:50:11,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:50:11" (1/1) ... [2019-12-07 18:50:11,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:50:11,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:50:12,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:50:12,032 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:50:12,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:50:12,070 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:50:12,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12 WrapperNode [2019-12-07 18:50:12,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:50:12,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:50:12,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:50:12,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:50:12,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (1/1) ... [2019-12-07 18:50:12,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (1/1) ... [2019-12-07 18:50:12,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:50:12,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:50:12,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:50:12,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:50:12,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (1/1) ... [2019-12-07 18:50:12,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (1/1) ... [2019-12-07 18:50:12,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (1/1) ... [2019-12-07 18:50:12,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (1/1) ... [2019-12-07 18:50:12,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (1/1) ... [2019-12-07 18:50:12,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (1/1) ... [2019-12-07 18:50:12,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (1/1) ... [2019-12-07 18:50:12,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:50:12,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:50:12,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:50:12,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:50:12,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8decdfb2-2303-43e8-837d-b7bb16cc6c25/bin/uautomizer/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-12-07 18:50:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:50:12,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:50:12,480 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:50:12,480 INFO L287 CfgBuilder]: Removed 28 assume(true) statements. [2019-12-07 18:50:12,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:50:12 BoogieIcfgContainer [2019-12-07 18:50:12,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:50:12,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:50:12,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:50:12,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:50:12,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:50:11" (1/3) ... [2019-12-07 18:50:12,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa656c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:50:12, skipping insertion in model container [2019-12-07 18:50:12,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:50:12" (2/3) ... [2019-12-07 18:50:12,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa656c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:50:12, skipping insertion in model container [2019-12-07 18:50:12,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:50:12" (3/3) ... [2019-12-07 18:50:12,488 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2019-12-07 18:50:12,496 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:50:12,501 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-12-07 18:50:12,508 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-12-07 18:50:12,524 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:50:12,525 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:50:12,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:50:12,525 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:50:12,525 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:50:12,525 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:50:12,525 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:50:12,525 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:50:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-12-07 18:50:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 18:50:12,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:12,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:50:12,546 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:12,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:12,550 INFO L82 PathProgramCache]: Analyzing trace with hash 922901410, now seen corresponding path program 1 times [2019-12-07 18:50:12,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:12,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540221696] [2019-12-07 18:50:12,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:12,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540221696] [2019-12-07 18:50:12,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:12,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:50:12,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783039066] [2019-12-07 18:50:12,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 18:50:12,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:12,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 18:50:12,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 18:50:12,657 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 2 states. [2019-12-07 18:50:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:12,678 INFO L93 Difference]: Finished difference Result 263 states and 369 transitions. [2019-12-07 18:50:12,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 18:50:12,679 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-12-07 18:50:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:12,687 INFO L225 Difference]: With dead ends: 263 [2019-12-07 18:50:12,687 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 18:50:12,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-12-07 18:50:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 18:50:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-07 18:50:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 18:50:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2019-12-07 18:50:12,718 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 6 [2019-12-07 18:50:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:12,718 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2019-12-07 18:50:12,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 18:50:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2019-12-07 18:50:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 18:50:12,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:12,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:50:12,719 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-12-07 18:50:12,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:12,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356416096] [2019-12-07 18:50:12,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:12,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356416096] [2019-12-07 18:50:12,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:12,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:50:12,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195682103] [2019-12-07 18:50:12,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:50:12,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:12,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:50:12,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:50:12,757 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand 4 states. [2019-12-07 18:50:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:12,836 INFO L93 Difference]: Finished difference Result 224 states and 269 transitions. [2019-12-07 18:50:12,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:50:12,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 18:50:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:12,837 INFO L225 Difference]: With dead ends: 224 [2019-12-07 18:50:12,838 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 18:50:12,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:50:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 18:50:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2019-12-07 18:50:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 18:50:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2019-12-07 18:50:12,845 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 6 [2019-12-07 18:50:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:12,846 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2019-12-07 18:50:12,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:50:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2019-12-07 18:50:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:50:12,846 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:12,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:12,846 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:12,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash -118682603, now seen corresponding path program 1 times [2019-12-07 18:50:12,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:12,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446111213] [2019-12-07 18:50:12,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:12,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446111213] [2019-12-07 18:50:12,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:12,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:50:12,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851427577] [2019-12-07 18:50:12,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:50:12,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:12,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:50:12,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:50:12,872 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 4 states. [2019-12-07 18:50:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:12,921 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2019-12-07 18:50:12,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:50:12,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 18:50:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:12,922 INFO L225 Difference]: With dead ends: 129 [2019-12-07 18:50:12,923 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 18:50:12,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:50:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 18:50:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-12-07 18:50:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 18:50:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-12-07 18:50:12,933 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 9 [2019-12-07 18:50:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:12,933 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-12-07 18:50:12,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:50:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-12-07 18:50:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:50:12,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:12,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:12,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:12,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:12,935 INFO L82 PathProgramCache]: Analyzing trace with hash 615806736, now seen corresponding path program 1 times [2019-12-07 18:50:12,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:12,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587258294] [2019-12-07 18:50:12,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:12,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587258294] [2019-12-07 18:50:12,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:12,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:50:12,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416464921] [2019-12-07 18:50:12,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:50:12,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:50:12,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:50:12,959 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 3 states. [2019-12-07 18:50:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:12,990 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2019-12-07 18:50:12,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:50:12,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 18:50:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:12,991 INFO L225 Difference]: With dead ends: 123 [2019-12-07 18:50:12,991 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 18:50:12,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:50:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 18:50:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 83. [2019-12-07 18:50:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 18:50:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-12-07 18:50:12,997 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 10 [2019-12-07 18:50:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:12,997 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-12-07 18:50:12,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:50:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-12-07 18:50:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:50:12,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:12,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:12,998 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:12,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1497311933, now seen corresponding path program 1 times [2019-12-07 18:50:12,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:12,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466257992] [2019-12-07 18:50:12,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:13,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466257992] [2019-12-07 18:50:13,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:13,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:50:13,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496676305] [2019-12-07 18:50:13,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:50:13,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:13,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:50:13,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:50:13,021 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 4 states. [2019-12-07 18:50:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:13,061 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2019-12-07 18:50:13,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:50:13,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:50:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:13,062 INFO L225 Difference]: With dead ends: 127 [2019-12-07 18:50:13,062 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 18:50:13,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:50:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 18:50:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-12-07 18:50:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 18:50:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-12-07 18:50:13,068 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 11 [2019-12-07 18:50:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:13,069 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-12-07 18:50:13,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:50:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-12-07 18:50:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 18:50:13,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:13,070 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:13,070 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:13,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:13,070 INFO L82 PathProgramCache]: Analyzing trace with hash -832741477, now seen corresponding path program 1 times [2019-12-07 18:50:13,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:13,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890350766] [2019-12-07 18:50:13,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:13,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890350766] [2019-12-07 18:50:13,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:13,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:50:13,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017043555] [2019-12-07 18:50:13,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:50:13,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:13,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:50:13,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:50:13,093 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 4 states. [2019-12-07 18:50:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:13,136 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2019-12-07 18:50:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:50:13,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 18:50:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:13,137 INFO L225 Difference]: With dead ends: 130 [2019-12-07 18:50:13,137 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 18:50:13,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:50:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 18:50:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2019-12-07 18:50:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 18:50:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2019-12-07 18:50:13,143 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 12 [2019-12-07 18:50:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:13,144 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2019-12-07 18:50:13,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:50:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2019-12-07 18:50:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:50:13,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:13,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:13,145 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash 952355221, now seen corresponding path program 1 times [2019-12-07 18:50:13,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:13,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071460940] [2019-12-07 18:50:13,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:13,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071460940] [2019-12-07 18:50:13,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:13,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:50:13,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077403803] [2019-12-07 18:50:13,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:50:13,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:13,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:50:13,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:50:13,166 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand 4 states. [2019-12-07 18:50:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:13,217 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2019-12-07 18:50:13,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:50:13,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:50:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:13,219 INFO L225 Difference]: With dead ends: 172 [2019-12-07 18:50:13,219 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 18:50:13,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:50:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 18:50:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 87. [2019-12-07 18:50:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 18:50:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-12-07 18:50:13,226 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 14 [2019-12-07 18:50:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:13,227 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-12-07 18:50:13,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:50:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-12-07 18:50:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:50:13,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:13,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:13,228 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash -513187613, now seen corresponding path program 1 times [2019-12-07 18:50:13,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:13,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065198022] [2019-12-07 18:50:13,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:13,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065198022] [2019-12-07 18:50:13,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:13,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:50:13,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465674988] [2019-12-07 18:50:13,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:50:13,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:13,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:50:13,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:50:13,259 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 4 states. [2019-12-07 18:50:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:13,307 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2019-12-07 18:50:13,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:50:13,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:50:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:13,309 INFO L225 Difference]: With dead ends: 127 [2019-12-07 18:50:13,309 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 18:50:13,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:50:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 18:50:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 82. [2019-12-07 18:50:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 18:50:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-12-07 18:50:13,315 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 14 [2019-12-07 18:50:13,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:13,315 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-12-07 18:50:13,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:50:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-12-07 18:50:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:50:13,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:13,317 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:13,317 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:13,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:13,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2134556229, now seen corresponding path program 1 times [2019-12-07 18:50:13,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:13,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143382274] [2019-12-07 18:50:13,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:13,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143382274] [2019-12-07 18:50:13,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:13,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:50:13,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647855841] [2019-12-07 18:50:13,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:50:13,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:13,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:50:13,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:50:13,342 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 4 states. [2019-12-07 18:50:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:13,393 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2019-12-07 18:50:13,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:50:13,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:50:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:13,395 INFO L225 Difference]: With dead ends: 162 [2019-12-07 18:50:13,395 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 18:50:13,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:50:13,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 18:50:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 72. [2019-12-07 18:50:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 18:50:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-12-07 18:50:13,401 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 15 [2019-12-07 18:50:13,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:13,401 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-12-07 18:50:13,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:50:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-12-07 18:50:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:50:13,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:13,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:13,403 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash -324557016, now seen corresponding path program 1 times [2019-12-07 18:50:13,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:13,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281222278] [2019-12-07 18:50:13,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:13,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281222278] [2019-12-07 18:50:13,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:13,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:50:13,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096522382] [2019-12-07 18:50:13,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:50:13,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:13,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:50:13,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:50:13,545 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 9 states. [2019-12-07 18:50:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:13,699 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2019-12-07 18:50:13,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:50:13,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-12-07 18:50:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:13,700 INFO L225 Difference]: With dead ends: 114 [2019-12-07 18:50:13,700 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 18:50:13,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:50:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 18:50:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-12-07 18:50:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 18:50:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-12-07 18:50:13,705 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 17 [2019-12-07 18:50:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:13,705 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-12-07 18:50:13,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:50:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-12-07 18:50:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:50:13,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:13,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:13,707 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:13,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1112826903, now seen corresponding path program 1 times [2019-12-07 18:50:13,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:13,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100198306] [2019-12-07 18:50:13,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:13,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100198306] [2019-12-07 18:50:13,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:13,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:50:13,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444507882] [2019-12-07 18:50:13,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:50:13,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:13,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:50:13,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:50:13,816 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 8 states. [2019-12-07 18:50:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:13,934 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2019-12-07 18:50:13,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:50:13,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 18:50:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:13,936 INFO L225 Difference]: With dead ends: 162 [2019-12-07 18:50:13,936 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 18:50:13,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:50:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 18:50:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 90. [2019-12-07 18:50:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 18:50:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-12-07 18:50:13,943 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 21 [2019-12-07 18:50:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:13,943 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-12-07 18:50:13,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:50:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-12-07 18:50:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:50:13,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:13,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:13,944 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2013141521, now seen corresponding path program 1 times [2019-12-07 18:50:13,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:13,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615461822] [2019-12-07 18:50:13,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:14,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615461822] [2019-12-07 18:50:14,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:14,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:50:14,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709006215] [2019-12-07 18:50:14,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:50:14,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:14,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:50:14,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:50:14,052 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 8 states. [2019-12-07 18:50:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:14,202 INFO L93 Difference]: Finished difference Result 232 states and 273 transitions. [2019-12-07 18:50:14,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:50:14,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-07 18:50:14,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:14,203 INFO L225 Difference]: With dead ends: 232 [2019-12-07 18:50:14,203 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 18:50:14,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:50:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 18:50:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 130. [2019-12-07 18:50:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 18:50:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2019-12-07 18:50:14,211 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 23 [2019-12-07 18:50:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:14,211 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2019-12-07 18:50:14,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:50:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2019-12-07 18:50:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:50:14,212 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:14,212 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:14,213 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:14,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1836591731, now seen corresponding path program 1 times [2019-12-07 18:50:14,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:14,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808149616] [2019-12-07 18:50:14,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:14,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808149616] [2019-12-07 18:50:14,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:14,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:50:14,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561367541] [2019-12-07 18:50:14,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:50:14,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:14,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:50:14,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:50:14,281 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand 8 states. [2019-12-07 18:50:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:14,490 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2019-12-07 18:50:14,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:50:14,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-07 18:50:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:14,491 INFO L225 Difference]: With dead ends: 162 [2019-12-07 18:50:14,491 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 18:50:14,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:50:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 18:50:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-07 18:50:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 18:50:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2019-12-07 18:50:14,495 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 23 [2019-12-07 18:50:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:14,495 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2019-12-07 18:50:14,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:50:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2019-12-07 18:50:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:50:14,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:14,496 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:14,497 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:14,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:14,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1319121376, now seen corresponding path program 1 times [2019-12-07 18:50:14,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:14,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96040846] [2019-12-07 18:50:14,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:14,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96040846] [2019-12-07 18:50:14,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:14,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:50:14,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691001613] [2019-12-07 18:50:14,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:50:14,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:14,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:50:14,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:50:14,581 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand 7 states. [2019-12-07 18:50:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:14,721 INFO L93 Difference]: Finished difference Result 294 states and 332 transitions. [2019-12-07 18:50:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:50:14,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-07 18:50:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:14,722 INFO L225 Difference]: With dead ends: 294 [2019-12-07 18:50:14,722 INFO L226 Difference]: Without dead ends: 250 [2019-12-07 18:50:14,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:50:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-12-07 18:50:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 130. [2019-12-07 18:50:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 18:50:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2019-12-07 18:50:14,729 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 27 [2019-12-07 18:50:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:14,729 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2019-12-07 18:50:14,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:50:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2019-12-07 18:50:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:50:14,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:14,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:14,730 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash 590911882, now seen corresponding path program 1 times [2019-12-07 18:50:14,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:14,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374587756] [2019-12-07 18:50:14,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:14,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374587756] [2019-12-07 18:50:14,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:14,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:50:14,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740509272] [2019-12-07 18:50:14,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:50:14,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:50:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:50:14,882 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand 9 states. [2019-12-07 18:50:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:15,107 INFO L93 Difference]: Finished difference Result 175 states and 203 transitions. [2019-12-07 18:50:15,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:50:15,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-12-07 18:50:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:15,108 INFO L225 Difference]: With dead ends: 175 [2019-12-07 18:50:15,108 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 18:50:15,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:50:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 18:50:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 120. [2019-12-07 18:50:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 18:50:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2019-12-07 18:50:15,117 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 29 [2019-12-07 18:50:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:15,117 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2019-12-07 18:50:15,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:50:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2019-12-07 18:50:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:50:15,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:15,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:15,118 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:15,118 INFO L82 PathProgramCache]: Analyzing trace with hash 767461672, now seen corresponding path program 1 times [2019-12-07 18:50:15,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:15,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495154483] [2019-12-07 18:50:15,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:15,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495154483] [2019-12-07 18:50:15,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:15,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:50:15,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298623354] [2019-12-07 18:50:15,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:50:15,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:15,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:50:15,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:50:15,179 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand 6 states. [2019-12-07 18:50:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:15,245 INFO L93 Difference]: Finished difference Result 166 states and 197 transitions. [2019-12-07 18:50:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:50:15,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 18:50:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:15,247 INFO L225 Difference]: With dead ends: 166 [2019-12-07 18:50:15,247 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 18:50:15,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:50:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 18:50:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-12-07 18:50:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 18:50:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2019-12-07 18:50:15,255 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 29 [2019-12-07 18:50:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:15,255 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2019-12-07 18:50:15,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:50:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2019-12-07 18:50:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 18:50:15,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:15,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:15,256 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1093653162, now seen corresponding path program 1 times [2019-12-07 18:50:15,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:15,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322619063] [2019-12-07 18:50:15,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:50:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:50:15,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322619063] [2019-12-07 18:50:15,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:50:15,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:50:15,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815789169] [2019-12-07 18:50:15,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:50:15,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:50:15,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:50:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:50:15,315 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 6 states. [2019-12-07 18:50:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:50:15,406 INFO L93 Difference]: Finished difference Result 227 states and 251 transitions. [2019-12-07 18:50:15,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:50:15,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 18:50:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:50:15,408 INFO L225 Difference]: With dead ends: 227 [2019-12-07 18:50:15,408 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 18:50:15,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:50:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 18:50:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 127. [2019-12-07 18:50:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 18:50:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2019-12-07 18:50:15,414 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 31 [2019-12-07 18:50:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:50:15,414 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2019-12-07 18:50:15,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:50:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2019-12-07 18:50:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:50:15,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:50:15,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:50:15,415 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 18:50:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:50:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash 964745492, now seen corresponding path program 1 times [2019-12-07 18:50:15,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:50:15,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826395870] [2019-12-07 18:50:15,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:50:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:50:15,453 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:50:15,453 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:50:15,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:50:15 BoogieIcfgContainer [2019-12-07 18:50:15,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:50:15,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:50:15,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:50:15,475 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:50:15,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:50:12" (3/4) ... [2019-12-07 18:50:15,478 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:50:15,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:50:15,480 INFO L168 Benchmark]: Toolchain (without parser) took 3644.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -115.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:15,480 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:50:15,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:15,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.86 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:15,481 INFO L168 Benchmark]: Boogie Preprocessor took 25.21 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:15,481 INFO L168 Benchmark]: RCFGBuilder took 351.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:15,482 INFO L168 Benchmark]: TraceAbstraction took 2992.58 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -16.8 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:15,482 INFO L168 Benchmark]: Witness Printer took 3.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:50:15,484 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 234.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.86 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.21 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 351.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2992.58 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -16.8 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 101, overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L217] unsigned int a ; [L218] unsigned int ma = __VERIFIER_nondet_uint(); [L219] signed char ea = __VERIFIER_nondet_char(); [L220] unsigned int b ; [L221] unsigned int mb = __VERIFIER_nondet_uint(); [L222] signed char eb = __VERIFIER_nondet_char(); [L223] unsigned int r_add ; [L224] unsigned int zero ; [L225] int sa ; [L226] int sb ; [L227] int tmp ; [L228] int tmp___0 ; [L229] int tmp___1 ; [L230] int tmp___2 ; [L231] int tmp___3 ; [L232] int tmp___4 ; [L233] int tmp___5 ; [L234] int tmp___6 ; [L235] int tmp___7 ; [L236] int tmp___8 ; [L237] int tmp___9 ; [L238] int __retres23 ; [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND TRUE ! m [L21] __retres4 = 0U [L71] return (__retres4); [L242] zero = base2flt(0, 0) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND FALSE !(m >= 1U << 25U) [L67] m = m & ~ (1U << 24U) [L68] EXPR e + 128 [L68] res = m | ((unsigned int ) (e + 128) << 24U) [L69] __retres4 = res [L71] return (__retres4); [L243] a = base2flt(ma, ea) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND TRUE m >= 1U << 25U [L55] COND TRUE e >= 127 [L56] __retres4 = 4294967295U [L71] return (__retres4); [L244] b = base2flt(mb, eb) [L246] COND FALSE !(a < zero) [L249] COND TRUE a > zero [L250] tmp = 1 [L254] sa = tmp [L256] COND FALSE !(b < zero) [L259] COND TRUE b > zero [L260] tmp___0 = 1 [L264] sb = tmp___0 [L75] unsigned int res ; [L76] unsigned int ma ; [L77] unsigned int mb ; [L78] unsigned int delta ; [L79] int ea ; [L80] int eb ; [L81] unsigned int tmp ; [L82] unsigned int __retres10 ; [L85] COND TRUE a < b [L86] tmp = a [L87] a = b [L88] b = tmp [L92] COND FALSE !(! b) [L99] ma = a & ((1U << 24U) - 1U) [L100] EXPR (int )(a >> 24U) - 128 [L100] ea = (int )(a >> 24U) - 128 [L101] ma = ma | (1U << 24U) [L102] mb = b & ((1U << 24U) - 1U) [L103] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 28 error locations. Result: UNSAFE, OverallTime: 2.9s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1850 SDtfs, 2173 SDslu, 4106 SDs, 0 SdLazy, 1090 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 760 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 33514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...