./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/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 0e04f2515dd5c7ce697460622800d33932bf1903 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/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.24-6b5699a [2019-11-25 08:53:54,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:53:54,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:53:54,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:53:54,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:53:54,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:53:54,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:53:54,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:53:54,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:53:54,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:53:54,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:53:54,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:53:54,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:53:54,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:53:54,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:53:54,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:53:54,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:53:54,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:53:54,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:53:54,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:53:54,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:53:54,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:53:54,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:53:54,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:53:54,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:53:54,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:53:54,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:53:54,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:53:54,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:53:54,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:53:54,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:53:54,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:53:54,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:53:54,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:53:54,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:53:54,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:53:54,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:53:54,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:53:54,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:53:54,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:53:54,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:53:54,942 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-25 08:53:54,955 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:53:54,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:53:54,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:53:54,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:53:54,956 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:53:54,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:53:54,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:53:54,957 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:53:54,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:53:54,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:53:54,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:53:54,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:53:54,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:53:54,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:53:54,959 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-25 08:53:54,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:53:54,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:53:54,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:53:54,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:53:54,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:53:54,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:53:54,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:53:54,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:53:54,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:54,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:53:54,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:53:54,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:53:54,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:53:54,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:53:54,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:53:54,962 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_c07abd9b-90fd-437a-a532-b768ccafd969/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 -> 0e04f2515dd5c7ce697460622800d33932bf1903 [2019-11-25 08:53:55,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:53:55,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:53:55,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:53:55,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:53:55,107 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:53:55,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-25 08:53:55,163 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/bin/uautomizer/data/b776e9b71/9abb29bca48a4ec89fd5511ccea0ba67/FLAGad9170043 [2019-11-25 08:53:55,568 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:53:55,569 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-25 08:53:55,576 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/bin/uautomizer/data/b776e9b71/9abb29bca48a4ec89fd5511ccea0ba67/FLAGad9170043 [2019-11-25 08:53:55,585 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/bin/uautomizer/data/b776e9b71/9abb29bca48a4ec89fd5511ccea0ba67 [2019-11-25 08:53:55,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:53:55,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:53:55,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:55,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:53:55,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:53:55,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c85197b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55, skipping insertion in model container [2019-11-25 08:53:55,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:55,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:53:55,634 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:53:55,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:55,941 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:53:55,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:55,998 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:53:55,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55 WrapperNode [2019-11-25 08:53:55,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:55,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:55,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:53:55,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:53:56,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:56,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:56,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:56,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:53:56,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:53:56,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:53:56,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:56,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:56,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:56,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:56,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:56,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:56,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... [2019-11-25 08:53:56,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:53:56,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:53:56,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:53:56,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:53:56,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c07abd9b-90fd-437a-a532-b768ccafd969/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-11-25 08:53:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:53:56,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:53:56,727 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:53:56,727 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-25 08:53:56,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:56 BoogieIcfgContainer [2019-11-25 08:53:56,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:53:56,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:53:56,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:53:56,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:53:56,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:53:55" (1/3) ... [2019-11-25 08:53:56,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec07aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:56, skipping insertion in model container [2019-11-25 08:53:56,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:55" (2/3) ... [2019-11-25 08:53:56,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec07aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:56, skipping insertion in model container [2019-11-25 08:53:56,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:56" (3/3) ... [2019-11-25 08:53:56,735 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2019-11-25 08:53:56,743 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:53:56,750 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-11-25 08:53:56,759 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-11-25 08:53:56,800 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:53:56,800 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:53:56,800 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:53:56,801 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:53:56,802 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:53:56,803 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:53:56,803 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:53:56,804 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:53:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-11-25 08:53:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-25 08:53:56,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:56,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:53:56,848 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-11-25 08:53:56,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash 922901410, now seen corresponding path program 1 times [2019-11-25 08:53:56,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:56,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449170193] [2019-11-25 08:53:56,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:56,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449170193] [2019-11-25 08:53:56,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:56,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:56,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950856518] [2019-11-25 08:53:56,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:53:56,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:56,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:53:56,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:53:56,995 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 2 states. [2019-11-25 08:53:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,031 INFO L93 Difference]: Finished difference Result 269 states and 377 transitions. [2019-11-25 08:53:57,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:53:57,032 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-25 08:53:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,043 INFO L225 Difference]: With dead ends: 269 [2019-11-25 08:53:57,043 INFO L226 Difference]: Without dead ends: 106 [2019-11-25 08:53:57,047 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-11-25 08:53:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-25 08:53:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-25 08:53:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-25 08:53:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2019-11-25 08:53:57,086 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 6 [2019-11-25 08:53:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,087 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2019-11-25 08:53:57,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:53:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2019-11-25 08:53:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-25 08:53:57,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,089 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-11-25 08:53:57,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,090 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-11-25 08:53:57,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662766061] [2019-11-25 08:53:57,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:57,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662766061] [2019-11-25 08:53:57,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:57,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:57,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158983577] [2019-11-25 08:53:57,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:57,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:57,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:57,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:57,157 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand 4 states. [2019-11-25 08:53:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,325 INFO L93 Difference]: Finished difference Result 230 states and 275 transitions. [2019-11-25 08:53:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:57,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-25 08:53:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,328 INFO L225 Difference]: With dead ends: 230 [2019-11-25 08:53:57,330 INFO L226 Difference]: Without dead ends: 126 [2019-11-25 08:53:57,331 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-11-25 08:53:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-25 08:53:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 86. [2019-11-25 08:53:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-25 08:53:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2019-11-25 08:53:57,344 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 6 [2019-11-25 08:53:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,345 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2019-11-25 08:53:57,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2019-11-25 08:53:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:53:57,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,347 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-11-25 08:53:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash -118682603, now seen corresponding path program 1 times [2019-11-25 08:53:57,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847733608] [2019-11-25 08:53:57,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:57,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847733608] [2019-11-25 08:53:57,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:57,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:57,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973688516] [2019-11-25 08:53:57,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:57,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:57,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:57,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:57,422 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 4 states. [2019-11-25 08:53:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,500 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2019-11-25 08:53:57,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:57,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-25 08:53:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,504 INFO L225 Difference]: With dead ends: 133 [2019-11-25 08:53:57,504 INFO L226 Difference]: Without dead ends: 129 [2019-11-25 08:53:57,505 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-11-25 08:53:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-25 08:53:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 87. [2019-11-25 08:53:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-25 08:53:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-11-25 08:53:57,522 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 9 [2019-11-25 08:53:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,523 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-11-25 08:53:57,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-11-25 08:53:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:53:57,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,529 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-11-25 08:53:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash 615806736, now seen corresponding path program 1 times [2019-11-25 08:53:57,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869286379] [2019-11-25 08:53:57,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:57,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869286379] [2019-11-25 08:53:57,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:57,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:57,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029764882] [2019-11-25 08:53:57,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:57,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:57,581 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 3 states. [2019-11-25 08:53:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,631 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2019-11-25 08:53:57,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:57,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 08:53:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,634 INFO L225 Difference]: With dead ends: 127 [2019-11-25 08:53:57,634 INFO L226 Difference]: Without dead ends: 125 [2019-11-25 08:53:57,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-25 08:53:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-11-25 08:53:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-25 08:53:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-11-25 08:53:57,649 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 10 [2019-11-25 08:53:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,649 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-11-25 08:53:57,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-11-25 08:53:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:53:57,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,651 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-11-25 08:53:57,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1497311933, now seen corresponding path program 1 times [2019-11-25 08:53:57,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157654978] [2019-11-25 08:53:57,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:57,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157654978] [2019-11-25 08:53:57,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:57,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:57,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255440249] [2019-11-25 08:53:57,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:57,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:57,708 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 4 states. [2019-11-25 08:53:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,778 INFO L93 Difference]: Finished difference Result 131 states and 155 transitions. [2019-11-25 08:53:57,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:57,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-25 08:53:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,780 INFO L225 Difference]: With dead ends: 131 [2019-11-25 08:53:57,780 INFO L226 Difference]: Without dead ends: 129 [2019-11-25 08:53:57,781 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-11-25 08:53:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-25 08:53:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 87. [2019-11-25 08:53:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-25 08:53:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-11-25 08:53:57,797 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 11 [2019-11-25 08:53:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,798 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-11-25 08:53:57,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-11-25 08:53:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:53:57,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,800 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-11-25 08:53:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash -832741477, now seen corresponding path program 1 times [2019-11-25 08:53:57,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090333904] [2019-11-25 08:53:57,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:57,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090333904] [2019-11-25 08:53:57,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:57,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:57,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998042458] [2019-11-25 08:53:57,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:57,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:57,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:57,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:57,870 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 4 states. [2019-11-25 08:53:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,937 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2019-11-25 08:53:57,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:57,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-25 08:53:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,942 INFO L225 Difference]: With dead ends: 134 [2019-11-25 08:53:57,942 INFO L226 Difference]: Without dead ends: 132 [2019-11-25 08:53:57,942 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-11-25 08:53:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-25 08:53:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2019-11-25 08:53:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-25 08:53:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2019-11-25 08:53:57,964 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 12 [2019-11-25 08:53:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,965 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2019-11-25 08:53:57,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2019-11-25 08:53:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:53:57,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,970 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-11-25 08:53:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,971 INFO L82 PathProgramCache]: Analyzing trace with hash 952355221, now seen corresponding path program 1 times [2019-11-25 08:53:57,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436334037] [2019-11-25 08:53:57,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:58,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436334037] [2019-11-25 08:53:58,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:58,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:58,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100975658] [2019-11-25 08:53:58,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:58,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:58,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:58,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:58,024 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 4 states. [2019-11-25 08:53:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:58,106 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2019-11-25 08:53:58,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:58,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-25 08:53:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:58,109 INFO L225 Difference]: With dead ends: 178 [2019-11-25 08:53:58,109 INFO L226 Difference]: Without dead ends: 176 [2019-11-25 08:53:58,109 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-11-25 08:53:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-25 08:53:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 89. [2019-11-25 08:53:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-25 08:53:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-25 08:53:58,118 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 14 [2019-11-25 08:53:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:58,118 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-25 08:53:58,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-25 08:53:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:53:58,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:58,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:58,120 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-11-25 08:53:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash -513187613, now seen corresponding path program 1 times [2019-11-25 08:53:58,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:58,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497545403] [2019-11-25 08:53:58,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:58,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497545403] [2019-11-25 08:53:58,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:58,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:58,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780932083] [2019-11-25 08:53:58,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:58,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:58,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:58,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:58,177 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 4 states. [2019-11-25 08:53:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:58,255 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2019-11-25 08:53:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:58,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-25 08:53:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:58,257 INFO L225 Difference]: With dead ends: 131 [2019-11-25 08:53:58,257 INFO L226 Difference]: Without dead ends: 129 [2019-11-25 08:53:58,257 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-11-25 08:53:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-25 08:53:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 84. [2019-11-25 08:53:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-25 08:53:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2019-11-25 08:53:58,273 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 14 [2019-11-25 08:53:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:58,274 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2019-11-25 08:53:58,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2019-11-25 08:53:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:53:58,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:58,275 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:58,276 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-11-25 08:53:58,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2134556229, now seen corresponding path program 1 times [2019-11-25 08:53:58,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:58,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562039548] [2019-11-25 08:53:58,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:58,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562039548] [2019-11-25 08:53:58,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:58,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:58,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357566172] [2019-11-25 08:53:58,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:58,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:58,301 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand 4 states. [2019-11-25 08:53:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:58,368 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2019-11-25 08:53:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:58,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-25 08:53:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:58,370 INFO L225 Difference]: With dead ends: 168 [2019-11-25 08:53:58,371 INFO L226 Difference]: Without dead ends: 166 [2019-11-25 08:53:58,371 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-11-25 08:53:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-25 08:53:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 74. [2019-11-25 08:53:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 08:53:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2019-11-25 08:53:58,378 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 15 [2019-11-25 08:53:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:58,378 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2019-11-25 08:53:58,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2019-11-25 08:53:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 08:53:58,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:58,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:58,380 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-11-25 08:53:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash -324557016, now seen corresponding path program 1 times [2019-11-25 08:53:58,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:58,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423589784] [2019-11-25 08:53:58,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:58,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423589784] [2019-11-25 08:53:58,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:58,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:53:58,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659738348] [2019-11-25 08:53:58,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:53:58,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:58,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:53:58,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:53:58,565 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 9 states. [2019-11-25 08:53:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:58,808 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2019-11-25 08:53:58,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:53:58,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-25 08:53:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:58,810 INFO L225 Difference]: With dead ends: 118 [2019-11-25 08:53:58,810 INFO L226 Difference]: Without dead ends: 76 [2019-11-25 08:53:58,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:53:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-25 08:53:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-11-25 08:53:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 08:53:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2019-11-25 08:53:58,830 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 17 [2019-11-25 08:53:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:58,831 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2019-11-25 08:53:58,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:53:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2019-11-25 08:53:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:53:58,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:58,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:58,833 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-11-25 08:53:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1112826903, now seen corresponding path program 1 times [2019-11-25 08:53:58,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:58,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463761123] [2019-11-25 08:53:58,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:59,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463761123] [2019-11-25 08:53:59,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:59,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:53:59,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611243783] [2019-11-25 08:53:59,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:53:59,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:59,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:53:59,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:59,007 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 8 states. [2019-11-25 08:53:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:59,227 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2019-11-25 08:53:59,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:53:59,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-25 08:53:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:59,229 INFO L225 Difference]: With dead ends: 170 [2019-11-25 08:53:59,229 INFO L226 Difference]: Without dead ends: 140 [2019-11-25 08:53:59,230 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-11-25 08:53:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-25 08:53:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2019-11-25 08:53:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-25 08:53:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-11-25 08:53:59,237 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 21 [2019-11-25 08:53:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:59,239 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-11-25 08:53:59,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:53:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-11-25 08:53:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:53:59,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:59,240 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-11-25 08:53:59,241 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-11-25 08:53:59,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:59,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2013141521, now seen corresponding path program 1 times [2019-11-25 08:53:59,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:59,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766997127] [2019-11-25 08:53:59,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:59,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766997127] [2019-11-25 08:53:59,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:59,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:53:59,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264543463] [2019-11-25 08:53:59,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:53:59,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:59,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:53:59,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:59,422 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 8 states. [2019-11-25 08:53:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:59,661 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2019-11-25 08:53:59,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:53:59,662 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-25 08:53:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:59,664 INFO L225 Difference]: With dead ends: 240 [2019-11-25 08:53:59,664 INFO L226 Difference]: Without dead ends: 192 [2019-11-25 08:53:59,666 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-11-25 08:53:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-25 08:53:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 132. [2019-11-25 08:53:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-25 08:53:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2019-11-25 08:53:59,677 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 23 [2019-11-25 08:53:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:59,677 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2019-11-25 08:53:59,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:53:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2019-11-25 08:53:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:53:59,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:59,681 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-11-25 08:53:59,681 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-11-25 08:53:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1836591731, now seen corresponding path program 1 times [2019-11-25 08:53:59,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:59,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113385722] [2019-11-25 08:53:59,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:59,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113385722] [2019-11-25 08:53:59,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:59,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:53:59,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404726024] [2019-11-25 08:53:59,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:53:59,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:59,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:53:59,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:59,801 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand 8 states. [2019-11-25 08:54:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:00,010 INFO L93 Difference]: Finished difference Result 166 states and 197 transitions. [2019-11-25 08:54:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:54:00,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-25 08:54:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:00,012 INFO L225 Difference]: With dead ends: 166 [2019-11-25 08:54:00,012 INFO L226 Difference]: Without dead ends: 92 [2019-11-25 08:54:00,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:54:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-25 08:54:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-25 08:54:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-25 08:54:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2019-11-25 08:54:00,019 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 23 [2019-11-25 08:54:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:00,019 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2019-11-25 08:54:00,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:54:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2019-11-25 08:54:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:54:00,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:00,021 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-11-25 08:54:00,021 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-11-25 08:54:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1319121376, now seen corresponding path program 1 times [2019-11-25 08:54:00,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:00,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836733452] [2019-11-25 08:54:00,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:00,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836733452] [2019-11-25 08:54:00,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:00,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:54:00,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846477805] [2019-11-25 08:54:00,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:54:00,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:00,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:54:00,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:00,169 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand 7 states. [2019-11-25 08:54:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:00,395 INFO L93 Difference]: Finished difference Result 308 states and 346 transitions. [2019-11-25 08:54:00,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:54:00,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-25 08:54:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:00,397 INFO L225 Difference]: With dead ends: 308 [2019-11-25 08:54:00,397 INFO L226 Difference]: Without dead ends: 262 [2019-11-25 08:54:00,399 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-11-25 08:54:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-25 08:54:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 132. [2019-11-25 08:54:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-25 08:54:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-11-25 08:54:00,409 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 27 [2019-11-25 08:54:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:00,409 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-11-25 08:54:00,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:54:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-11-25 08:54:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:54:00,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:00,412 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-11-25 08:54:00,412 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-11-25 08:54:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash 590911882, now seen corresponding path program 1 times [2019-11-25 08:54:00,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:00,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58779821] [2019-11-25 08:54:00,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:00,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58779821] [2019-11-25 08:54:00,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:00,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:54:00,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000786601] [2019-11-25 08:54:00,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:54:00,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:00,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:54:00,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:54:00,641 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 9 states. [2019-11-25 08:54:00,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:00,997 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2019-11-25 08:54:00,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:54:00,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-25 08:54:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:01,000 INFO L225 Difference]: With dead ends: 181 [2019-11-25 08:54:01,001 INFO L226 Difference]: Without dead ends: 180 [2019-11-25 08:54:01,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:54:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-25 08:54:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 122. [2019-11-25 08:54:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-25 08:54:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2019-11-25 08:54:01,014 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 29 [2019-11-25 08:54:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:01,014 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2019-11-25 08:54:01,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:54:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2019-11-25 08:54:01,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:54:01,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:01,017 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-11-25 08:54:01,018 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-11-25 08:54:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash 767461672, now seen corresponding path program 1 times [2019-11-25 08:54:01,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:01,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797906194] [2019-11-25 08:54:01,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:01,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797906194] [2019-11-25 08:54:01,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:01,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:54:01,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321056004] [2019-11-25 08:54:01,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:54:01,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:01,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:54:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:54:01,097 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand 6 states. [2019-11-25 08:54:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:01,210 INFO L93 Difference]: Finished difference Result 170 states and 201 transitions. [2019-11-25 08:54:01,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:54:01,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-25 08:54:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:01,211 INFO L225 Difference]: With dead ends: 170 [2019-11-25 08:54:01,211 INFO L226 Difference]: Without dead ends: 122 [2019-11-25 08:54:01,212 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-11-25 08:54:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-25 08:54:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2019-11-25 08:54:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-25 08:54:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2019-11-25 08:54:01,220 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 29 [2019-11-25 08:54:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:01,220 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2019-11-25 08:54:01,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:54:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2019-11-25 08:54:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:54:01,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:01,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:01,221 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-11-25 08:54:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1093653162, now seen corresponding path program 1 times [2019-11-25 08:54:01,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:01,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875930380] [2019-11-25 08:54:01,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:01,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875930380] [2019-11-25 08:54:01,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:01,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:54:01,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784205045] [2019-11-25 08:54:01,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:54:01,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:01,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:54:01,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:54:01,303 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand 6 states. [2019-11-25 08:54:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:01,455 INFO L93 Difference]: Finished difference Result 237 states and 261 transitions. [2019-11-25 08:54:01,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:54:01,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-25 08:54:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:01,457 INFO L225 Difference]: With dead ends: 237 [2019-11-25 08:54:01,457 INFO L226 Difference]: Without dead ends: 206 [2019-11-25 08:54:01,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:54:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-25 08:54:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 129. [2019-11-25 08:54:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-25 08:54:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2019-11-25 08:54:01,467 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 31 [2019-11-25 08:54:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:01,467 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2019-11-25 08:54:01,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:54:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2019-11-25 08:54:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 08:54:01,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:01,468 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-11-25 08:54:01,469 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-11-25 08:54:01,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash 964745492, now seen corresponding path program 1 times [2019-11-25 08:54:01,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:01,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231258208] [2019-11-25 08:54:01,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:01,517 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:01,517 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:54:01,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:54:01 BoogieIcfgContainer [2019-11-25 08:54:01,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:54:01,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:54:01,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:54:01,548 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:54:01,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:56" (3/4) ... [2019-11-25 08:54:01,551 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:54:01,552 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:54:01,558 INFO L168 Benchmark]: Toolchain (without parser) took 5964.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:01,559 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:54:01,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:01,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.36 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-11-25 08:54:01,560 INFO L168 Benchmark]: Boogie Preprocessor took 76.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:01,562 INFO L168 Benchmark]: RCFGBuilder took 585.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:01,563 INFO L168 Benchmark]: TraceAbstraction took 4817.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:01,563 INFO L168 Benchmark]: Witness Printer took 4.42 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-11-25 08:54:01,566 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.45 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.36 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. * Boogie Preprocessor took 76.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 585.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4817.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.42 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: 102]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 101. Possible FailurePath: [L216] unsigned int a ; [L217] unsigned int ma = __VERIFIER_nondet_uint(); [L218] signed char ea = __VERIFIER_nondet_char(); [L219] unsigned int b ; [L220] unsigned int mb = __VERIFIER_nondet_uint(); [L221] signed char eb = __VERIFIER_nondet_char(); [L222] unsigned int r_add ; [L223] unsigned int zero ; [L224] int sa ; [L225] int sb ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int tmp___1 ; [L229] int tmp___2 ; [L230] int tmp___3 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L233] int tmp___6 ; [L234] int tmp___7 ; [L235] int tmp___8 ; [L236] int tmp___9 ; [L237] int __retres23 ; [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND TRUE ! m [L20] __retres4 = 0U [L70] return (__retres4); [L241] zero = base2flt(0, 0) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] EXPR e + 128 [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L242] a = base2flt(ma, ea) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND TRUE m >= 1U << 25U [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U [L70] return (__retres4); [L243] b = base2flt(mb, eb) [L245] COND FALSE !(a < zero) [L248] COND TRUE a > zero [L249] tmp = 1 [L253] sa = tmp [L255] COND FALSE !(b < zero) [L258] COND TRUE b > zero [L259] tmp___0 = 1 [L263] sb = tmp___0 [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; [L84] COND TRUE a < b [L85] tmp = a [L86] a = b [L87] b = tmp [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] EXPR (int )(a >> 24U) - 128 [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 28 error locations. Result: UNSAFE, OverallTime: 4.7s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1907 SDtfs, 2273 SDslu, 4236 SDs, 0 SdLazy, 1090 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 808 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s 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...