./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/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:47:29,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:29,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:29,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:29,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:29,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:29,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:29,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:29,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:29,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:29,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:29,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:29,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:29,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:29,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:29,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:29,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:29,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:29,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:29,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:29,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:29,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:29,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:29,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:29,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:29,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:29,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:29,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:29,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:29,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:29,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:29,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:29,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:29,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:29,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:29,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:29,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:29,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:29,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:29,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:29,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:29,098 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-25 08:47:29,113 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:29,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:29,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:29,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:29,114 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:29,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:29,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:47:29,115 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:47:29,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:29,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:47:29,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:29,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:47:29,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:47:29,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:47:29,116 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-25 08:47:29,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:47:29,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:29,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:29,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:47:29,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:29,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:29,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:47:29,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:47:29,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:29,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:29,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:47:29,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:47:29,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:29,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:47:29,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:47:29,119 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_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 [2019-11-25 08:47:29,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:29,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:29,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:29,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:29,280 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:29,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-25 08:47:29,333 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer/data/5af8de3c8/690f44831f3b4b8794ea48e877ef3fa1/FLAG7ef40d505 [2019-11-25 08:47:29,770 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:29,771 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-11-25 08:47:29,781 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer/data/5af8de3c8/690f44831f3b4b8794ea48e877ef3fa1/FLAG7ef40d505 [2019-11-25 08:47:30,131 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/bin/uautomizer/data/5af8de3c8/690f44831f3b4b8794ea48e877ef3fa1 [2019-11-25 08:47:30,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:30,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:30,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:30,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:30,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:30,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:30" (1/1) ... [2019-11-25 08:47:30,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446ef515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30, skipping insertion in model container [2019-11-25 08:47:30,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:30" (1/1) ... [2019-11-25 08:47:30,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:30,198 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:30,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:30,573 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:30,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:30,629 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:30,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30 WrapperNode [2019-11-25 08:47:30,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:30,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:30,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:30,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:30,637 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:47:30" (1/1) ... [2019-11-25 08:47:30,644 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:47:30" (1/1) ... [2019-11-25 08:47:30,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:30,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:30,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:30,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:30,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30" (1/1) ... [2019-11-25 08:47:30,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30" (1/1) ... [2019-11-25 08:47:30,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30" (1/1) ... [2019-11-25 08:47:30,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30" (1/1) ... [2019-11-25 08:47:30,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30" (1/1) ... [2019-11-25 08:47:30,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30" (1/1) ... [2019-11-25 08:47:30,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30" (1/1) ... [2019-11-25 08:47:30,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:30,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:30,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:30,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:30,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_535e56f2-880e-4de8-941d-bcb15bedf885/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:47:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:30,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:31,304 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:31,305 INFO L284 CfgBuilder]: Removed 28 assume(true) statements. [2019-11-25 08:47:31,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:31 BoogieIcfgContainer [2019-11-25 08:47:31,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:31,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:47:31,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:47:31,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:47:31,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:47:30" (1/3) ... [2019-11-25 08:47:31,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1ab133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:31, skipping insertion in model container [2019-11-25 08:47:31,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:30" (2/3) ... [2019-11-25 08:47:31,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1ab133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:31, skipping insertion in model container [2019-11-25 08:47:31,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:31" (3/3) ... [2019-11-25 08:47:31,313 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2019-11-25 08:47:31,321 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:47:31,327 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-11-25 08:47:31,337 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-11-25 08:47:31,358 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:47:31,358 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:47:31,358 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:47:31,358 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:31,358 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:31,359 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:47:31,359 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:31,359 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:47:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-11-25 08:47:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-25 08:47:31,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:31,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:47:31,386 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:47:31,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash 922901410, now seen corresponding path program 1 times [2019-11-25 08:47:31,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:31,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038868540] [2019-11-25 08:47:31,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:31,500 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:47:31,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038868540] [2019-11-25 08:47:31,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:31,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:31,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555661499] [2019-11-25 08:47:31,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:47:31,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:31,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:47:31,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:47:31,521 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 2 states. [2019-11-25 08:47:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:31,551 INFO L93 Difference]: Finished difference Result 263 states and 369 transitions. [2019-11-25 08:47:31,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:47:31,553 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-25 08:47:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:31,563 INFO L225 Difference]: With dead ends: 263 [2019-11-25 08:47:31,563 INFO L226 Difference]: Without dead ends: 104 [2019-11-25 08:47:31,567 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:47:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-25 08:47:31,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-25 08:47:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-25 08:47:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2019-11-25 08:47:31,604 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 6 [2019-11-25 08:47:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:31,604 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2019-11-25 08:47:31,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:47:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2019-11-25 08:47:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-25 08:47:31,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:31,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:47:31,606 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:47:31,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-11-25 08:47:31,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:31,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219392553] [2019-11-25 08:47:31,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:31,667 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:47:31,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219392553] [2019-11-25 08:47:31,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:31,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:31,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626271303] [2019-11-25 08:47:31,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:31,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:31,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:31,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:31,670 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand 4 states. [2019-11-25 08:47:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:31,848 INFO L93 Difference]: Finished difference Result 224 states and 269 transitions. [2019-11-25 08:47:31,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:31,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-25 08:47:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:31,851 INFO L225 Difference]: With dead ends: 224 [2019-11-25 08:47:31,851 INFO L226 Difference]: Without dead ends: 122 [2019-11-25 08:47:31,852 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:47:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-25 08:47:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2019-11-25 08:47:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-25 08:47:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2019-11-25 08:47:31,867 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 6 [2019-11-25 08:47:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:31,868 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2019-11-25 08:47:31,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2019-11-25 08:47:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:47:31,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:31,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:31,869 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:47:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash -118682603, now seen corresponding path program 1 times [2019-11-25 08:47:31,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:31,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876680948] [2019-11-25 08:47:31,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:31,938 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:47:31,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876680948] [2019-11-25 08:47:31,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:31,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:31,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479378268] [2019-11-25 08:47:31,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:31,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:31,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:31,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:31,940 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 4 states. [2019-11-25 08:47:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:32,024 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2019-11-25 08:47:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:32,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-25 08:47:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:32,027 INFO L225 Difference]: With dead ends: 129 [2019-11-25 08:47:32,027 INFO L226 Difference]: Without dead ends: 125 [2019-11-25 08:47:32,027 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:47:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-25 08:47:32,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-11-25 08:47:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-25 08:47:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-11-25 08:47:32,038 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 9 [2019-11-25 08:47:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:32,039 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-11-25 08:47:32,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-11-25 08:47:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:47:32,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:32,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:32,040 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:47:32,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash 615806736, now seen corresponding path program 1 times [2019-11-25 08:47:32,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:32,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291548141] [2019-11-25 08:47:32,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:32,064 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:47:32,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291548141] [2019-11-25 08:47:32,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:32,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:32,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990786000] [2019-11-25 08:47:32,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:32,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:32,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:32,066 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 3 states. [2019-11-25 08:47:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:32,125 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2019-11-25 08:47:32,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:32,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 08:47:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:32,128 INFO L225 Difference]: With dead ends: 123 [2019-11-25 08:47:32,128 INFO L226 Difference]: Without dead ends: 121 [2019-11-25 08:47:32,128 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:47:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-25 08:47:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 83. [2019-11-25 08:47:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-25 08:47:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-11-25 08:47:32,147 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 10 [2019-11-25 08:47:32,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:32,147 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-11-25 08:47:32,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-11-25 08:47:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:47:32,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:32,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:32,149 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:47:32,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:32,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1497311933, now seen corresponding path program 1 times [2019-11-25 08:47:32,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:32,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124583695] [2019-11-25 08:47:32,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:32,205 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:47:32,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124583695] [2019-11-25 08:47:32,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:32,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:32,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340053651] [2019-11-25 08:47:32,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:32,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:32,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:32,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:32,206 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 4 states. [2019-11-25 08:47:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:32,290 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2019-11-25 08:47:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:32,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-25 08:47:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:32,292 INFO L225 Difference]: With dead ends: 127 [2019-11-25 08:47:32,292 INFO L226 Difference]: Without dead ends: 125 [2019-11-25 08:47:32,292 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:47:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-25 08:47:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-11-25 08:47:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-25 08:47:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-11-25 08:47:32,301 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 11 [2019-11-25 08:47:32,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:32,302 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-11-25 08:47:32,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-11-25 08:47:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:47:32,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:32,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:32,303 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:47:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:32,303 INFO L82 PathProgramCache]: Analyzing trace with hash -832741477, now seen corresponding path program 1 times [2019-11-25 08:47:32,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:32,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261584520] [2019-11-25 08:47:32,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:32,339 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:47:32,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261584520] [2019-11-25 08:47:32,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:32,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:32,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873355088] [2019-11-25 08:47:32,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:32,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:32,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:32,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:32,341 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 4 states. [2019-11-25 08:47:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:32,416 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2019-11-25 08:47:32,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:32,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-25 08:47:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:32,418 INFO L225 Difference]: With dead ends: 130 [2019-11-25 08:47:32,418 INFO L226 Difference]: Without dead ends: 128 [2019-11-25 08:47:32,418 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:47:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-25 08:47:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2019-11-25 08:47:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-25 08:47:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2019-11-25 08:47:32,427 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 12 [2019-11-25 08:47:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:32,428 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2019-11-25 08:47:32,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2019-11-25 08:47:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:47:32,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:32,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:32,429 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:47:32,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash 952355221, now seen corresponding path program 1 times [2019-11-25 08:47:32,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:32,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492052409] [2019-11-25 08:47:32,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:32,457 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:47:32,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492052409] [2019-11-25 08:47:32,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:32,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:32,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233866129] [2019-11-25 08:47:32,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:32,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:32,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:32,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:32,459 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand 4 states. [2019-11-25 08:47:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:32,541 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2019-11-25 08:47:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:32,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-25 08:47:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:32,543 INFO L225 Difference]: With dead ends: 172 [2019-11-25 08:47:32,543 INFO L226 Difference]: Without dead ends: 170 [2019-11-25 08:47:32,543 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:47:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-25 08:47:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 87. [2019-11-25 08:47:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-25 08:47:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-11-25 08:47:32,551 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 14 [2019-11-25 08:47:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:32,552 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-11-25 08:47:32,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-11-25 08:47:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:47:32,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:32,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:32,553 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:47:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash -513187613, now seen corresponding path program 1 times [2019-11-25 08:47:32,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:32,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843215282] [2019-11-25 08:47:32,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:32,587 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:47:32,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843215282] [2019-11-25 08:47:32,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:32,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:32,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64964079] [2019-11-25 08:47:32,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:32,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:32,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:32,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:32,589 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 4 states. [2019-11-25 08:47:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:32,659 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2019-11-25 08:47:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:32,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-25 08:47:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:32,661 INFO L225 Difference]: With dead ends: 127 [2019-11-25 08:47:32,661 INFO L226 Difference]: Without dead ends: 125 [2019-11-25 08:47:32,661 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:47:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-25 08:47:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 82. [2019-11-25 08:47:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-25 08:47:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-11-25 08:47:32,669 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 14 [2019-11-25 08:47:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:32,669 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-11-25 08:47:32,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-11-25 08:47:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:47:32,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:32,671 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:32,671 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:47:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:32,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2134556229, now seen corresponding path program 1 times [2019-11-25 08:47:32,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:32,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020524253] [2019-11-25 08:47:32,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:32,725 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:47:32,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020524253] [2019-11-25 08:47:32,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:32,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:32,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450311506] [2019-11-25 08:47:32,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:32,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:32,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:32,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:32,727 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 4 states. [2019-11-25 08:47:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:32,804 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2019-11-25 08:47:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:32,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-25 08:47:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:32,806 INFO L225 Difference]: With dead ends: 162 [2019-11-25 08:47:32,806 INFO L226 Difference]: Without dead ends: 160 [2019-11-25 08:47:32,807 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:47:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-25 08:47:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 72. [2019-11-25 08:47:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-25 08:47:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-11-25 08:47:32,814 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 15 [2019-11-25 08:47:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:32,814 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-11-25 08:47:32,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-11-25 08:47:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 08:47:32,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:32,816 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:47:32,816 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:47:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash -324557016, now seen corresponding path program 1 times [2019-11-25 08:47:32,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:32,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835602002] [2019-11-25 08:47:32,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:33,069 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:47:33,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835602002] [2019-11-25 08:47:33,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:33,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:47:33,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116221528] [2019-11-25 08:47:33,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:47:33,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:33,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:47:33,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:47:33,071 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 9 states. [2019-11-25 08:47:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:33,339 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2019-11-25 08:47:33,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:47:33,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-25 08:47:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:33,341 INFO L225 Difference]: With dead ends: 114 [2019-11-25 08:47:33,341 INFO L226 Difference]: Without dead ends: 74 [2019-11-25 08:47:33,341 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:47:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-25 08:47:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-25 08:47:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-25 08:47:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-25 08:47:33,347 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 17 [2019-11-25 08:47:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:33,347 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-25 08:47:33,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:47:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-25 08:47:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:47:33,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:33,348 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:47:33,349 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:47:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1112826903, now seen corresponding path program 1 times [2019-11-25 08:47:33,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:33,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068539651] [2019-11-25 08:47:33,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:33,533 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:47:33,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068539651] [2019-11-25 08:47:33,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:33,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:47:33,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968789756] [2019-11-25 08:47:33,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:47:33,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:33,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:47:33,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:47:33,535 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 8 states. [2019-11-25 08:47:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:33,735 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2019-11-25 08:47:33,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:47:33,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-25 08:47:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:33,737 INFO L225 Difference]: With dead ends: 162 [2019-11-25 08:47:33,737 INFO L226 Difference]: Without dead ends: 134 [2019-11-25 08:47:33,738 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:47:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-25 08:47:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 90. [2019-11-25 08:47:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-25 08:47:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-11-25 08:47:33,745 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 21 [2019-11-25 08:47:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:33,745 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-11-25 08:47:33,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:47:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-11-25 08:47:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:47:33,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:33,746 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:47:33,747 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:47:33,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:33,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2013141521, now seen corresponding path program 1 times [2019-11-25 08:47:33,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:33,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718451641] [2019-11-25 08:47:33,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:33,893 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:47:33,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718451641] [2019-11-25 08:47:33,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:33,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:47:33,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111839028] [2019-11-25 08:47:33,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:47:33,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:33,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:47:33,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:47:33,895 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 8 states. [2019-11-25 08:47:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:34,117 INFO L93 Difference]: Finished difference Result 232 states and 273 transitions. [2019-11-25 08:47:34,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:47:34,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-25 08:47:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:34,119 INFO L225 Difference]: With dead ends: 232 [2019-11-25 08:47:34,119 INFO L226 Difference]: Without dead ends: 186 [2019-11-25 08:47:34,119 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:47:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-25 08:47:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 130. [2019-11-25 08:47:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-25 08:47:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2019-11-25 08:47:34,129 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 23 [2019-11-25 08:47:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:34,130 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2019-11-25 08:47:34,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:47:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2019-11-25 08:47:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:47:34,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:34,131 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:47:34,131 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:47:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1836591731, now seen corresponding path program 1 times [2019-11-25 08:47:34,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:34,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744712596] [2019-11-25 08:47:34,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:34,217 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:47:34,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744712596] [2019-11-25 08:47:34,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:34,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:47:34,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142774946] [2019-11-25 08:47:34,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:47:34,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:34,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:47:34,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:47:34,218 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand 8 states. [2019-11-25 08:47:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:34,535 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2019-11-25 08:47:34,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:47:34,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-25 08:47:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:34,537 INFO L225 Difference]: With dead ends: 162 [2019-11-25 08:47:34,537 INFO L226 Difference]: Without dead ends: 90 [2019-11-25 08:47:34,537 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:47:34,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-25 08:47:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-25 08:47:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-25 08:47:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2019-11-25 08:47:34,543 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 23 [2019-11-25 08:47:34,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:34,544 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2019-11-25 08:47:34,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:47:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2019-11-25 08:47:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:47:34,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:34,545 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:47:34,545 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:47:34,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:34,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1319121376, now seen corresponding path program 1 times [2019-11-25 08:47:34,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:34,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291370576] [2019-11-25 08:47:34,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:34,688 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:47:34,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291370576] [2019-11-25 08:47:34,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:34,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:47:34,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498227829] [2019-11-25 08:47:34,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:47:34,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:34,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:47:34,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:34,690 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand 7 states. [2019-11-25 08:47:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:34,906 INFO L93 Difference]: Finished difference Result 294 states and 332 transitions. [2019-11-25 08:47:34,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:47:34,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-25 08:47:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:34,908 INFO L225 Difference]: With dead ends: 294 [2019-11-25 08:47:34,909 INFO L226 Difference]: Without dead ends: 250 [2019-11-25 08:47:34,910 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:47:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-25 08:47:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 130. [2019-11-25 08:47:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-25 08:47:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2019-11-25 08:47:34,919 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 27 [2019-11-25 08:47:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:34,920 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2019-11-25 08:47:34,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:47:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2019-11-25 08:47:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:47:34,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:34,923 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:47:34,924 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:47:34,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:34,924 INFO L82 PathProgramCache]: Analyzing trace with hash 590911882, now seen corresponding path program 1 times [2019-11-25 08:47:34,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:34,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610030097] [2019-11-25 08:47:34,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:35,138 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:47:35,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610030097] [2019-11-25 08:47:35,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:35,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:47:35,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146857009] [2019-11-25 08:47:35,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:47:35,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:35,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:47:35,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:47:35,140 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand 9 states. [2019-11-25 08:47:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:35,509 INFO L93 Difference]: Finished difference Result 175 states and 203 transitions. [2019-11-25 08:47:35,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:47:35,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-25 08:47:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:35,511 INFO L225 Difference]: With dead ends: 175 [2019-11-25 08:47:35,511 INFO L226 Difference]: Without dead ends: 174 [2019-11-25 08:47:35,512 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:47:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-25 08:47:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 120. [2019-11-25 08:47:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-25 08:47:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2019-11-25 08:47:35,521 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 29 [2019-11-25 08:47:35,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:35,521 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2019-11-25 08:47:35,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:47:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2019-11-25 08:47:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:47:35,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:35,522 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:47:35,523 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:47:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash 767461672, now seen corresponding path program 1 times [2019-11-25 08:47:35,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:35,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827274380] [2019-11-25 08:47:35,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:35,608 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:47:35,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827274380] [2019-11-25 08:47:35,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:35,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:35,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966445332] [2019-11-25 08:47:35,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:47:35,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:35,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:47:35,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:47:35,610 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand 6 states. [2019-11-25 08:47:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:35,717 INFO L93 Difference]: Finished difference Result 166 states and 197 transitions. [2019-11-25 08:47:35,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:35,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-25 08:47:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:35,718 INFO L225 Difference]: With dead ends: 166 [2019-11-25 08:47:35,718 INFO L226 Difference]: Without dead ends: 120 [2019-11-25 08:47:35,719 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:47:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-25 08:47:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-11-25 08:47:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-25 08:47:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2019-11-25 08:47:35,729 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 29 [2019-11-25 08:47:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:35,730 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2019-11-25 08:47:35,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:47:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2019-11-25 08:47:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:47:35,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:35,731 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:47:35,731 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:47:35,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:35,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1093653162, now seen corresponding path program 1 times [2019-11-25 08:47:35,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:35,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114625026] [2019-11-25 08:47:35,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:35,831 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:47:35,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114625026] [2019-11-25 08:47:35,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:35,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:47:35,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202904189] [2019-11-25 08:47:35,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:47:35,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:35,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:47:35,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:47:35,833 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 6 states. [2019-11-25 08:47:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:35,999 INFO L93 Difference]: Finished difference Result 227 states and 251 transitions. [2019-11-25 08:47:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:47:35,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-25 08:47:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:36,001 INFO L225 Difference]: With dead ends: 227 [2019-11-25 08:47:36,001 INFO L226 Difference]: Without dead ends: 198 [2019-11-25 08:47:36,002 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:47:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-25 08:47:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 127. [2019-11-25 08:47:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-25 08:47:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2019-11-25 08:47:36,012 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 31 [2019-11-25 08:47:36,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:36,013 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2019-11-25 08:47:36,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:47:36,013 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2019-11-25 08:47:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 08:47:36,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:36,014 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:47:36,014 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:47:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash 964745492, now seen corresponding path program 1 times [2019-11-25 08:47:36,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:36,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376703956] [2019-11-25 08:47:36,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:36,097 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:36,098 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:47:36,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:47:36 BoogieIcfgContainer [2019-11-25 08:47:36,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:47:36,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:36,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:36,141 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:36,141 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:31" (3/4) ... [2019-11-25 08:47:36,144 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:47:36,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:36,146 INFO L168 Benchmark]: Toolchain (without parser) took 6011.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -128.9 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:36,147 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:36,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:36,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.12 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:47:36,148 INFO L168 Benchmark]: Boogie Preprocessor took 32.85 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:47:36,149 INFO L168 Benchmark]: RCFGBuilder took 601.72 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:36,149 INFO L168 Benchmark]: TraceAbstraction took 4833.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.2 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:36,150 INFO L168 Benchmark]: Witness Printer took 4.28 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:47:36,152 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 494.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.12 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 32.85 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. * RCFGBuilder took 601.72 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4833.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.2 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 101, overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L217] unsigned int a ; [L218] unsigned int ma = __VERIFIER_nondet_uint(); [L219] signed char ea = __VERIFIER_nondet_char(); [L220] unsigned int b ; [L221] unsigned int mb = __VERIFIER_nondet_uint(); [L222] signed char eb = __VERIFIER_nondet_char(); [L223] unsigned int r_add ; [L224] unsigned int zero ; [L225] int sa ; [L226] int sb ; [L227] int tmp ; [L228] int tmp___0 ; [L229] int tmp___1 ; [L230] int tmp___2 ; [L231] int tmp___3 ; [L232] int tmp___4 ; [L233] int tmp___5 ; [L234] int tmp___6 ; [L235] int tmp___7 ; [L236] int tmp___8 ; [L237] int tmp___9 ; [L238] int __retres23 ; [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND TRUE ! m [L21] __retres4 = 0U [L71] return (__retres4); [L242] zero = base2flt(0, 0) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND FALSE !(m >= 1U << 25U) [L67] m = m & ~ (1U << 24U) [L68] EXPR e + 128 [L68] res = m | ((unsigned int ) (e + 128) << 24U) [L69] __retres4 = res [L71] return (__retres4); [L243] a = base2flt(ma, ea) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND TRUE m >= 1U << 25U [L55] COND TRUE e >= 127 [L56] __retres4 = 4294967295U [L71] return (__retres4); [L244] b = base2flt(mb, eb) [L246] COND FALSE !(a < zero) [L249] COND TRUE a > zero [L250] tmp = 1 [L254] sa = tmp [L256] COND FALSE !(b < zero) [L259] COND TRUE b > zero [L260] tmp___0 = 1 [L264] sb = tmp___0 [L75] unsigned int res ; [L76] unsigned int ma ; [L77] unsigned int mb ; [L78] unsigned int delta ; [L79] int ea ; [L80] int eb ; [L81] unsigned int tmp ; [L82] unsigned int __retres10 ; [L85] COND TRUE a < b [L86] tmp = a [L87] a = b [L88] b = tmp [L92] COND FALSE !(! b) [L99] ma = a & ((1U << 24U) - 1U) [L100] EXPR (int )(a >> 24U) - 128 [L100] ea = (int )(a >> 24U) - 128 [L101] ma = ma | (1U << 24U) [L102] mb = b & ((1U << 24U) - 1U) [L103] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 28 error locations. Result: UNSAFE, OverallTime: 4.7s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1850 SDtfs, 2173 SDslu, 4106 SDs, 0 SdLazy, 1090 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s 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=141occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 760 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.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...