./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/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 c172e82b435756efbbcf3396e72051c66081518f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/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.23-635dfa2 [2018-12-09 10:57:45,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:57:45,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:57:45,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:57:45,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:57:45,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:57:45,294 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:57:45,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:57:45,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:57:45,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:57:45,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:57:45,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:57:45,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:57:45,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:57:45,298 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:57:45,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:57:45,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:57:45,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:57:45,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:57:45,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:57:45,302 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:57:45,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:57:45,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:57:45,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:57:45,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:57:45,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:57:45,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:57:45,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:57:45,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:57:45,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:57:45,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:57:45,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:57:45,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:57:45,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:57:45,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:57:45,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:57:45,307 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-12-09 10:57:45,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:57:45,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:57:45,318 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:57:45,318 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:57:45,319 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:57:45,319 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:57:45,319 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:57:45,319 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:57:45,319 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:57:45,319 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:57:45,319 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:57:45,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:57:45,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:57:45,320 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:57:45,320 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:57:45,320 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:57:45,320 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-09 10:57:45,321 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:57:45,321 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:57:45,321 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:57:45,321 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:57:45,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:57:45,321 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:57:45,322 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:57:45,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:57:45,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:57:45,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:57:45,322 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:57:45,322 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:57:45,322 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:57:45,323 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:57:45,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:57:45,323 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/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 -> c172e82b435756efbbcf3396e72051c66081518f [2018-12-09 10:57:45,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:57:45,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:57:45,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:57:45,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:57:45,357 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:57:45,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i [2018-12-09 10:57:45,391 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/data/a29a39e13/ac5ce67287124152936af58bcd0e9adc/FLAG4d45f7863 [2018-12-09 10:57:45,729 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:57:45,729 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i [2018-12-09 10:57:45,733 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/data/a29a39e13/ac5ce67287124152936af58bcd0e9adc/FLAG4d45f7863 [2018-12-09 10:57:46,116 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/data/a29a39e13/ac5ce67287124152936af58bcd0e9adc [2018-12-09 10:57:46,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:57:46,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:57:46,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:57:46,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:57:46,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:57:46,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b53f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46, skipping insertion in model container [2018-12-09 10:57:46,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:57:46,140 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:57:46,240 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:57:46,242 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:57:46,262 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:57:46,271 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:57:46,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46 WrapperNode [2018-12-09 10:57:46,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:57:46,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:57:46,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:57:46,272 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:57:46,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:57:46,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:57:46,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:57:46,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:57:46,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (1/1) ... [2018-12-09 10:57:46,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:57:46,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:57:46,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:57:46,333 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:57:46,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/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 [2018-12-09 10:57:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-12-09 10:57:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-12-09 10:57:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 10:57:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 10:57:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:57:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:57:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 10:57:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 10:57:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 10:57:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 10:57:46,586 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:57:46,587 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 10:57:46,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:57:46 BoogieIcfgContainer [2018-12-09 10:57:46,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:57:46,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:57:46,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:57:46,589 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:57:46,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:57:46" (1/3) ... [2018-12-09 10:57:46,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba88ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:57:46, skipping insertion in model container [2018-12-09 10:57:46,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:57:46" (2/3) ... [2018-12-09 10:57:46,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba88ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:57:46, skipping insertion in model container [2018-12-09 10:57:46,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:57:46" (3/3) ... [2018-12-09 10:57:46,591 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1_false-no-overflow.i [2018-12-09 10:57:46,597 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:57:46,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-12-09 10:57:46,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-12-09 10:57:46,628 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:57:46,629 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:57:46,629 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:57:46,629 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:57:46,629 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:57:46,629 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:57:46,629 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:57:46,629 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:57:46,629 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:57:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-12-09 10:57:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 10:57:46,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:46,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:46,647 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:46,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1025559455, now seen corresponding path program 1 times [2018-12-09 10:57:46,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:46,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:46,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:46,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:46,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:57:46,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:46,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-09 10:57:46,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 10:57:46,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 10:57:46,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 10:57:46,734 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2018-12-09 10:57:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:46,750 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2018-12-09 10:57:46,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 10:57:46,751 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-09 10:57:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:46,756 INFO L225 Difference]: With dead ends: 154 [2018-12-09 10:57:46,756 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 10:57:46,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 10:57:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 10:57:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-09 10:57:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 10:57:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2018-12-09 10:57:46,781 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 9 [2018-12-09 10:57:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:46,781 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2018-12-09 10:57:46,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 10:57:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2018-12-09 10:57:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 10:57:46,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:46,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:46,782 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:46,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:46,783 INFO L82 PathProgramCache]: Analyzing trace with hash -133733111, now seen corresponding path program 1 times [2018-12-09 10:57:46,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:46,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:46,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:46,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:57:46,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:46,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:57:46,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:57:46,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:57:46,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:57:46,839 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand 3 states. [2018-12-09 10:57:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:46,915 INFO L93 Difference]: Finished difference Result 150 states and 217 transitions. [2018-12-09 10:57:46,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:57:46,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 10:57:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:46,916 INFO L225 Difference]: With dead ends: 150 [2018-12-09 10:57:46,916 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 10:57:46,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:57:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 10:57:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-12-09 10:57:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 10:57:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2018-12-09 10:57:46,922 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 18 [2018-12-09 10:57:46,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:46,922 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2018-12-09 10:57:46,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:57:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2018-12-09 10:57:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 10:57:46,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:46,923 INFO L402 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] [2018-12-09 10:57:46,924 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:46,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash -375227645, now seen corresponding path program 1 times [2018-12-09 10:57:46,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:46,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:46,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:46,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:57:46,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:46,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:57:46,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:57:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:57:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:57:46,970 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand 4 states. [2018-12-09 10:57:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:47,136 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2018-12-09 10:57:47,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:57:47,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-09 10:57:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:47,138 INFO L225 Difference]: With dead ends: 219 [2018-12-09 10:57:47,138 INFO L226 Difference]: Without dead ends: 172 [2018-12-09 10:57:47,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:57:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-09 10:57:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 124. [2018-12-09 10:57:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-09 10:57:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 166 transitions. [2018-12-09 10:57:47,144 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 166 transitions. Word has length 25 [2018-12-09 10:57:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:47,144 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 166 transitions. [2018-12-09 10:57:47,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:57:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 166 transitions. [2018-12-09 10:57:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 10:57:47,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:47,145 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:47,146 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:47,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:47,146 INFO L82 PathProgramCache]: Analyzing trace with hash -740983547, now seen corresponding path program 1 times [2018-12-09 10:57:47,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:47,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:47,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:47,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:47,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 10:57:47,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:47,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:57:47,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:57:47,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:57:47,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:57:47,191 INFO L87 Difference]: Start difference. First operand 124 states and 166 transitions. Second operand 4 states. [2018-12-09 10:57:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:47,330 INFO L93 Difference]: Finished difference Result 319 states and 452 transitions. [2018-12-09 10:57:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:57:47,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-09 10:57:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:47,331 INFO L225 Difference]: With dead ends: 319 [2018-12-09 10:57:47,331 INFO L226 Difference]: Without dead ends: 227 [2018-12-09 10:57:47,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:57:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-09 10:57:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 163. [2018-12-09 10:57:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-09 10:57:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 227 transitions. [2018-12-09 10:57:47,339 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 227 transitions. Word has length 32 [2018-12-09 10:57:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:47,339 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 227 transitions. [2018-12-09 10:57:47,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:57:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 227 transitions. [2018-12-09 10:57:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 10:57:47,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:47,340 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:47,341 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:47,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:47,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1838487559, now seen corresponding path program 1 times [2018-12-09 10:57:47,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:47,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:47,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 10:57:47,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:47,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:57:47,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:57:47,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:57:47,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:57:47,390 INFO L87 Difference]: Start difference. First operand 163 states and 227 transitions. Second operand 5 states. [2018-12-09 10:57:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:47,553 INFO L93 Difference]: Finished difference Result 460 states and 643 transitions. [2018-12-09 10:57:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:57:47,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-09 10:57:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:47,554 INFO L225 Difference]: With dead ends: 460 [2018-12-09 10:57:47,554 INFO L226 Difference]: Without dead ends: 327 [2018-12-09 10:57:47,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:57:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-09 10:57:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 176. [2018-12-09 10:57:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-09 10:57:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2018-12-09 10:57:47,562 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 39 [2018-12-09 10:57:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:47,562 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2018-12-09 10:57:47,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:57:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2018-12-09 10:57:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 10:57:47,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:47,563 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:47,564 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:47,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:47,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1692244499, now seen corresponding path program 1 times [2018-12-09 10:57:47,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:47,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:47,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:47,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:47,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 10:57:47,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:47,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:57:47,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:57:47,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:57:47,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:57:47,608 INFO L87 Difference]: Start difference. First operand 176 states and 243 transitions. Second operand 5 states. [2018-12-09 10:57:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:47,630 INFO L93 Difference]: Finished difference Result 308 states and 431 transitions. [2018-12-09 10:57:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:57:47,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-09 10:57:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:47,631 INFO L225 Difference]: With dead ends: 308 [2018-12-09 10:57:47,632 INFO L226 Difference]: Without dead ends: 153 [2018-12-09 10:57:47,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:57:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-09 10:57:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-09 10:57:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-09 10:57:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 212 transitions. [2018-12-09 10:57:47,640 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 212 transitions. Word has length 42 [2018-12-09 10:57:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:47,640 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 212 transitions. [2018-12-09 10:57:47,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:57:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 212 transitions. [2018-12-09 10:57:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 10:57:47,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:47,641 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:47,642 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:47,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:47,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1208666722, now seen corresponding path program 1 times [2018-12-09 10:57:47,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:47,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:47,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:47,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:47,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 10:57:47,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:47,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:57:47,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:57:47,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:57:47,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:57:47,687 INFO L87 Difference]: Start difference. First operand 153 states and 212 transitions. Second operand 3 states. [2018-12-09 10:57:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:47,696 INFO L93 Difference]: Finished difference Result 210 states and 292 transitions. [2018-12-09 10:57:47,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:57:47,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 10:57:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:47,697 INFO L225 Difference]: With dead ends: 210 [2018-12-09 10:57:47,697 INFO L226 Difference]: Without dead ends: 180 [2018-12-09 10:57:47,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:57:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-09 10:57:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-09 10:57:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-09 10:57:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 250 transitions. [2018-12-09 10:57:47,704 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 250 transitions. Word has length 48 [2018-12-09 10:57:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:47,704 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 250 transitions. [2018-12-09 10:57:47,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:57:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 250 transitions. [2018-12-09 10:57:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 10:57:47,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:47,706 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:47,707 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:47,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:47,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1718139812, now seen corresponding path program 1 times [2018-12-09 10:57:47,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:47,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:47,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:47,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:47,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 10:57:47,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:57:47,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:57:47,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:47,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:57:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 10:57:47,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 10:57:47,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-12-09 10:57:47,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 10:57:47,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 10:57:47,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:57:47,953 INFO L87 Difference]: Start difference. First operand 180 states and 250 transitions. Second operand 11 states. [2018-12-09 10:57:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:48,553 INFO L93 Difference]: Finished difference Result 1012 states and 1444 transitions. [2018-12-09 10:57:48,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 10:57:48,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-12-09 10:57:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:48,555 INFO L225 Difference]: With dead ends: 1012 [2018-12-09 10:57:48,556 INFO L226 Difference]: Without dead ends: 831 [2018-12-09 10:57:48,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-12-09 10:57:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-09 10:57:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 439. [2018-12-09 10:57:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-12-09 10:57:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 587 transitions. [2018-12-09 10:57:48,572 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 587 transitions. Word has length 48 [2018-12-09 10:57:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:48,572 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 587 transitions. [2018-12-09 10:57:48,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 10:57:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 587 transitions. [2018-12-09 10:57:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 10:57:48,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:48,574 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:48,575 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:48,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1967996065, now seen corresponding path program 1 times [2018-12-09 10:57:48,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:48,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:48,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 10:57:48,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:57:48,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:57:48,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:48,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:57:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 10:57:48,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 10:57:48,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-12-09 10:57:48,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:57:48,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:57:48,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:57:48,696 INFO L87 Difference]: Start difference. First operand 439 states and 587 transitions. Second operand 8 states. [2018-12-09 10:57:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:49,348 INFO L93 Difference]: Finished difference Result 987 states and 1374 transitions. [2018-12-09 10:57:49,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 10:57:49,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-12-09 10:57:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:49,349 INFO L225 Difference]: With dead ends: 987 [2018-12-09 10:57:49,349 INFO L226 Difference]: Without dead ends: 524 [2018-12-09 10:57:49,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:57:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-12-09 10:57:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 313. [2018-12-09 10:57:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-12-09 10:57:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 373 transitions. [2018-12-09 10:57:49,360 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 373 transitions. Word has length 69 [2018-12-09 10:57:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:49,360 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 373 transitions. [2018-12-09 10:57:49,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:57:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 373 transitions. [2018-12-09 10:57:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 10:57:49,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:49,362 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:49,363 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:49,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:49,363 INFO L82 PathProgramCache]: Analyzing trace with hash 119876796, now seen corresponding path program 1 times [2018-12-09 10:57:49,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:49,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:49,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:49,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:49,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 10:57:49,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:57:49,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:57:49,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:49,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:57:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 10:57:49,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 10:57:49,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-12-09 10:57:49,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 10:57:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 10:57:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-09 10:57:49,616 INFO L87 Difference]: Start difference. First operand 313 states and 373 transitions. Second operand 13 states. [2018-12-09 10:57:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:51,083 INFO L93 Difference]: Finished difference Result 2116 states and 2527 transitions. [2018-12-09 10:57:51,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 10:57:51,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-12-09 10:57:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:51,087 INFO L225 Difference]: With dead ends: 2116 [2018-12-09 10:57:51,087 INFO L226 Difference]: Without dead ends: 1775 [2018-12-09 10:57:51,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=429, Invalid=1551, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 10:57:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2018-12-09 10:57:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 774. [2018-12-09 10:57:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2018-12-09 10:57:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1016 transitions. [2018-12-09 10:57:51,107 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1016 transitions. Word has length 85 [2018-12-09 10:57:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:51,107 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 1016 transitions. [2018-12-09 10:57:51,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 10:57:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1016 transitions. [2018-12-09 10:57:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 10:57:51,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:51,108 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:51,109 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:51,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1085051884, now seen corresponding path program 1 times [2018-12-09 10:57:51,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:51,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:51,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:51,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:51,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 10:57:51,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:57:51,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:57:51,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:51,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:57:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-09 10:57:51,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 10:57:51,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2018-12-09 10:57:51,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 10:57:51,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 10:57:51,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:57:51,326 INFO L87 Difference]: Start difference. First operand 774 states and 1016 transitions. Second operand 12 states. [2018-12-09 10:57:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:51,656 INFO L93 Difference]: Finished difference Result 1962 states and 2560 transitions. [2018-12-09 10:57:51,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:57:51,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2018-12-09 10:57:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:51,660 INFO L225 Difference]: With dead ends: 1962 [2018-12-09 10:57:51,660 INFO L226 Difference]: Without dead ends: 1218 [2018-12-09 10:57:51,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-09 10:57:51,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-12-09 10:57:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 739. [2018-12-09 10:57:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-12-09 10:57:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 996 transitions. [2018-12-09 10:57:51,688 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 996 transitions. Word has length 88 [2018-12-09 10:57:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:51,688 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 996 transitions. [2018-12-09 10:57:51,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 10:57:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 996 transitions. [2018-12-09 10:57:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 10:57:51,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:51,689 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:51,690 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:51,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1522493072, now seen corresponding path program 1 times [2018-12-09 10:57:51,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:51,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:51,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:51,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:51,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 10:57:51,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:57:51,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:57:51,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:57:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:57:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:57:51,788 INFO L87 Difference]: Start difference. First operand 739 states and 996 transitions. Second operand 8 states. [2018-12-09 10:57:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:52,208 INFO L93 Difference]: Finished difference Result 1848 states and 2539 transitions. [2018-12-09 10:57:52,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:57:52,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-12-09 10:57:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:52,210 INFO L225 Difference]: With dead ends: 1848 [2018-12-09 10:57:52,210 INFO L226 Difference]: Without dead ends: 1115 [2018-12-09 10:57:52,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:57:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-12-09 10:57:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 872. [2018-12-09 10:57:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-12-09 10:57:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1151 transitions. [2018-12-09 10:57:52,228 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1151 transitions. Word has length 88 [2018-12-09 10:57:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:52,228 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1151 transitions. [2018-12-09 10:57:52,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:57:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1151 transitions. [2018-12-09 10:57:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 10:57:52,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:52,229 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:52,229 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:52,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1431933580, now seen corresponding path program 1 times [2018-12-09 10:57:52,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:52,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:52,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:52,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:52,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 10:57:52,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:57:52,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:57:52,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:52,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:57:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 10:57:52,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:57:52,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-12-09 10:57:52,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 10:57:52,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 10:57:52,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:57:52,514 INFO L87 Difference]: Start difference. First operand 872 states and 1151 transitions. Second operand 14 states. [2018-12-09 10:57:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:53,934 INFO L93 Difference]: Finished difference Result 3480 states and 4255 transitions. [2018-12-09 10:57:53,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 10:57:53,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-12-09 10:57:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:53,938 INFO L225 Difference]: With dead ends: 3480 [2018-12-09 10:57:53,938 INFO L226 Difference]: Without dead ends: 1293 [2018-12-09 10:57:53,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-12-09 10:57:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-12-09 10:57:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 379. [2018-12-09 10:57:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-12-09 10:57:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 477 transitions. [2018-12-09 10:57:53,958 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 477 transitions. Word has length 90 [2018-12-09 10:57:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:53,959 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 477 transitions. [2018-12-09 10:57:53,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 10:57:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 477 transitions. [2018-12-09 10:57:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:57:53,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:53,960 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:53,961 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:53,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:53,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1110142188, now seen corresponding path program 1 times [2018-12-09 10:57:53,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:53,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:53,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:53,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:53,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 64 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 10:57:54,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:57:54,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab535f01-bb27-478a-823a-0dcec1daf307/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:57:54,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:57:54,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:57:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 10:57:54,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:57:54,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-12-09 10:57:54,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 10:57:54,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 10:57:54,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:57:54,162 INFO L87 Difference]: Start difference. First operand 379 states and 477 transitions. Second operand 11 states. [2018-12-09 10:57:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:57:54,589 INFO L93 Difference]: Finished difference Result 990 states and 1254 transitions. [2018-12-09 10:57:54,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 10:57:54,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 10:57:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:57:54,591 INFO L225 Difference]: With dead ends: 990 [2018-12-09 10:57:54,591 INFO L226 Difference]: Without dead ends: 442 [2018-12-09 10:57:54,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-12-09 10:57:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-12-09 10:57:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 428. [2018-12-09 10:57:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-12-09 10:57:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 533 transitions. [2018-12-09 10:57:54,601 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 533 transitions. Word has length 96 [2018-12-09 10:57:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:57:54,601 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 533 transitions. [2018-12-09 10:57:54,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 10:57:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 533 transitions. [2018-12-09 10:57:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 10:57:54,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:57:54,602 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:57:54,603 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 10:57:54,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:57:54,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1017750731, now seen corresponding path program 1 times [2018-12-09 10:57:54,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:57:54,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:57:54,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:54,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:57:54,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:57:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:57:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:57:54,649 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 10:57:54,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:57:54 BoogieIcfgContainer [2018-12-09 10:57:54,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:57:54,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:57:54,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:57:54,687 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:57:54,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:57:46" (3/4) ... [2018-12-09 10:57:54,690 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 10:57:54,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:57:54,691 INFO L168 Benchmark]: Toolchain (without parser) took 8572.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 956.0 MB in the beginning and 884.3 MB in the end (delta: 71.7 MB). Peak memory consumption was 255.2 MB. Max. memory is 11.5 GB. [2018-12-09 10:57:54,692 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:57:54,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.26 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 10:57:54,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.64 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:57:54,693 INFO L168 Benchmark]: Boogie Preprocessor took 47.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:57:54,693 INFO L168 Benchmark]: RCFGBuilder took 254.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:57:54,693 INFO L168 Benchmark]: TraceAbstraction took 8099.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 884.3 MB in the end (delta: 174.5 MB). Peak memory consumption was 263.1 MB. Max. memory is 11.5 GB. [2018-12-09 10:57:54,694 INFO L168 Benchmark]: Witness Printer took 3.20 ms. Allocated memory is still 1.2 GB. Free memory is still 884.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:57:54,695 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.26 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.64 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 254.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8099.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 884.3 MB in the end (delta: 174.5 MB). Peak memory consumption was 263.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.20 ms. Allocated memory is still 1.2 GB. Free memory is still 884.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] b = __VERIFIER_nondet_uint() [L109] a = 234770789 VAL [a=234770789, b=-2382254437] [L111] CALL mp_add(a, b) VAL [\old(a)=234770789, \old(b)=1912712859] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4] [L40] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4] [L49] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=65106, r0=917074] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L66] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L66] EXPR partial_sum + a1 [L66] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, r0=917074] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, r0=917074] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L67] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L67] EXPR partial_sum + a2 [L67] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=917074, r1=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=917074, r1=0] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L68] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L68] EXPR partial_sum + a3 [L68] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L76] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r1 << 8U VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r2 << 16U VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r3 << 24U VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 126 locations, 38 error locations. UNSAFE Result, 8.0s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1652 SDtfs, 4105 SDslu, 5300 SDs, 0 SdLazy, 5325 SolverSat, 499 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 480 SyntacticMatches, 14 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=872occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 3521 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1359 NumberOfCodeBlocks, 1359 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1233 ConstructedInterpolants, 77 QuantifiedInterpolants, 577875 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1027 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 818/970 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...