./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/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 758587bcbf021ce28de3aa106c09f74804dbda1d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/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-5842f4b [2018-11-18 09:46:36,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:46:36,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:46:36,553 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:46:36,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:46:36,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:46:36,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:46:36,556 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:46:36,557 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:46:36,558 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:46:36,559 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:46:36,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:46:36,559 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:46:36,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:46:36,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:46:36,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:46:36,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:46:36,563 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:46:36,564 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:46:36,565 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:46:36,566 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:46:36,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:46:36,568 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:46:36,569 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:46:36,569 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:46:36,569 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:46:36,570 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:46:36,571 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:46:36,571 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:46:36,572 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:46:36,572 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:46:36,573 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:46:36,573 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:46:36,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:46:36,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:46:36,574 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:46:36,574 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-11-18 09:46:36,584 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:46:36,584 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:46:36,585 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:46:36,585 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 09:46:36,585 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:46:36,585 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:46:36,586 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:46:36,586 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:46:36,586 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:46:36,586 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:46:36,586 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:46:36,586 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:46:36,586 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:46:36,586 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:46:36,587 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:46:36,587 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:46:36,587 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-18 09:46:36,587 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:46:36,587 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:46:36,587 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:46:36,587 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:46:36,587 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:46:36,588 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:46:36,588 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:46:36,588 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:46:36,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:46:36,588 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:46:36,588 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:46:36,588 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:46:36,589 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:46:36,589 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:46:36,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:46:36,589 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_589870e3-579c-4a04-9256-4b1f1112712d/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 -> 758587bcbf021ce28de3aa106c09f74804dbda1d [2018-11-18 09:46:36,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:46:36,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:46:36,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:46:36,625 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:46:36,625 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:46:36,626 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i [2018-11-18 09:46:36,662 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/bin-2019/uautomizer/data/59be7f879/cfcd8601175d4c78889a578ce4b6ed55/FLAG84cb44aac [2018-11-18 09:46:36,977 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:46:36,977 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i [2018-11-18 09:46:36,982 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/bin-2019/uautomizer/data/59be7f879/cfcd8601175d4c78889a578ce4b6ed55/FLAG84cb44aac [2018-11-18 09:46:36,993 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/bin-2019/uautomizer/data/59be7f879/cfcd8601175d4c78889a578ce4b6ed55 [2018-11-18 09:46:36,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:46:36,997 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 09:46:36,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:46:36,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:46:37,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:46:37,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:46:36" (1/1) ... [2018-11-18 09:46:37,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4915a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37, skipping insertion in model container [2018-11-18 09:46:37,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:46:36" (1/1) ... [2018-11-18 09:46:37,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:46:37,033 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:46:37,182 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:46:37,185 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:46:37,207 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:46:37,215 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:46:37,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37 WrapperNode [2018-11-18 09:46:37,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:46:37,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:46:37,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:46:37,216 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:46:37,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37" (1/1) ... [2018-11-18 09:46:37,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37" (1/1) ... [2018-11-18 09:46:37,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37" (1/1) ... [2018-11-18 09:46:37,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37" (1/1) ... [2018-11-18 09:46:37,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37" (1/1) ... [2018-11-18 09:46:37,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37" (1/1) ... [2018-11-18 09:46:37,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37" (1/1) ... [2018-11-18 09:46:37,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:46:37,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:46:37,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:46:37,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:46:37,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/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-11-18 09:46:37,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:46:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:46:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 09:46:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-18 09:46:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:46:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 09:46:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 09:46:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 09:46:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2018-11-18 09:46:37,319 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2018-11-18 09:46:37,319 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2018-11-18 09:46:37,319 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-18 09:46:37,319 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:46:37,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:46:37,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:46:37,642 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:46:37,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:37 BoogieIcfgContainer [2018-11-18 09:46:37,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:46:37,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:46:37,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:46:37,645 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:46:37,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:46:36" (1/3) ... [2018-11-18 09:46:37,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d7b841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:46:37, skipping insertion in model container [2018-11-18 09:46:37,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:46:37" (2/3) ... [2018-11-18 09:46:37,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d7b841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:46:37, skipping insertion in model container [2018-11-18 09:46:37,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:37" (3/3) ... [2018-11-18 09:46:37,647 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2_false-no-overflow.i [2018-11-18 09:46:37,653 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:46:37,659 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-11-18 09:46:37,668 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-11-18 09:46:37,690 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:46:37,690 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:46:37,690 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:46:37,690 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:46:37,690 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:46:37,690 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:46:37,691 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:46:37,691 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:46:37,691 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:46:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-11-18 09:46:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 09:46:37,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:37,710 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:37,712 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:37,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1564523809, now seen corresponding path program 1 times [2018-11-18 09:46:37,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:37,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:37,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:37,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:37,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:46:37,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:37,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-18 09:46:37,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 09:46:37,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 09:46:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:46:37,815 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2018-11-18 09:46:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:37,836 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2018-11-18 09:46:37,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 09:46:37,837 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-18 09:46:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:37,844 INFO L225 Difference]: With dead ends: 157 [2018-11-18 09:46:37,844 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 09:46:37,846 INFO L604 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-11-18 09:46:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 09:46:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-18 09:46:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 09:46:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2018-11-18 09:46:37,870 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 9 [2018-11-18 09:46:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:37,870 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2018-11-18 09:46:37,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 09:46:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2018-11-18 09:46:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 09:46:37,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:37,871 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:37,872 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:37,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:37,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1377991052, now seen corresponding path program 1 times [2018-11-18 09:46:37,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:37,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:37,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:46:37,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:37,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:46:37,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:46:37,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:46:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:46:37,952 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2018-11-18 09:46:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:38,055 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions. [2018-11-18 09:46:38,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:46:38,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 09:46:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:38,057 INFO L225 Difference]: With dead ends: 156 [2018-11-18 09:46:38,057 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 09:46:38,058 INFO L604 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-11-18 09:46:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 09:46:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-11-18 09:46:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 09:46:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-11-18 09:46:38,066 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 20 [2018-11-18 09:46:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:38,066 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-11-18 09:46:38,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:46:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-11-18 09:46:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 09:46:38,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:38,067 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 09:46:38,068 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:38,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:38,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1088504138, now seen corresponding path program 1 times [2018-11-18 09:46:38,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:38,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:38,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:38,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:38,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:46:38,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:38,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:46:38,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:46:38,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:46:38,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:46:38,135 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 4 states. [2018-11-18 09:46:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:38,373 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2018-11-18 09:46:38,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:46:38,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-18 09:46:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:38,375 INFO L225 Difference]: With dead ends: 227 [2018-11-18 09:46:38,375 INFO L226 Difference]: Without dead ends: 178 [2018-11-18 09:46:38,375 INFO L604 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-11-18 09:46:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-18 09:46:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 130. [2018-11-18 09:46:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 09:46:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 172 transitions. [2018-11-18 09:46:38,384 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 172 transitions. Word has length 28 [2018-11-18 09:46:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:38,384 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 172 transitions. [2018-11-18 09:46:38,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:46:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2018-11-18 09:46:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 09:46:38,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:38,385 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 09:46:38,386 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:38,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:38,386 INFO L82 PathProgramCache]: Analyzing trace with hash 48430116, now seen corresponding path program 1 times [2018-11-18 09:46:38,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:38,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:38,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:38,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:38,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 09:46:38,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:38,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:46:38,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:46:38,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:46:38,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:46:38,468 INFO L87 Difference]: Start difference. First operand 130 states and 172 transitions. Second operand 4 states. [2018-11-18 09:46:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:38,635 INFO L93 Difference]: Finished difference Result 331 states and 464 transitions. [2018-11-18 09:46:38,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:46:38,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 09:46:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:38,637 INFO L225 Difference]: With dead ends: 331 [2018-11-18 09:46:38,637 INFO L226 Difference]: Without dead ends: 235 [2018-11-18 09:46:38,638 INFO L604 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-11-18 09:46:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-18 09:46:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 171. [2018-11-18 09:46:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-18 09:46:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 235 transitions. [2018-11-18 09:46:38,649 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 235 transitions. Word has length 36 [2018-11-18 09:46:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:38,650 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 235 transitions. [2018-11-18 09:46:38,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:46:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 235 transitions. [2018-11-18 09:46:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 09:46:38,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:38,651 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 09:46:38,652 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:38,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash 740020430, now seen corresponding path program 1 times [2018-11-18 09:46:38,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:38,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:38,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 09:46:38,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:38,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:46:38,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:46:38,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:46:38,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:46:38,738 INFO L87 Difference]: Start difference. First operand 171 states and 235 transitions. Second operand 5 states. [2018-11-18 09:46:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:38,933 INFO L93 Difference]: Finished difference Result 482 states and 665 transitions. [2018-11-18 09:46:38,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:46:38,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 09:46:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:38,935 INFO L225 Difference]: With dead ends: 482 [2018-11-18 09:46:38,935 INFO L226 Difference]: Without dead ends: 342 [2018-11-18 09:46:38,936 INFO L604 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-11-18 09:46:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-18 09:46:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2018-11-18 09:46:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-18 09:46:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 252 transitions. [2018-11-18 09:46:38,947 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 252 transitions. Word has length 44 [2018-11-18 09:46:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:38,947 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 252 transitions. [2018-11-18 09:46:38,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:46:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 252 transitions. [2018-11-18 09:46:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 09:46:38,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:38,948 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1] [2018-11-18 09:46:38,949 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:38,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1510638398, now seen corresponding path program 1 times [2018-11-18 09:46:38,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:38,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:38,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:38,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 09:46:39,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:39,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:46:39,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:46:39,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:46:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:46:39,003 INFO L87 Difference]: Start difference. First operand 185 states and 252 transitions. Second operand 5 states. [2018-11-18 09:46:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:39,179 INFO L93 Difference]: Finished difference Result 490 states and 673 transitions. [2018-11-18 09:46:39,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:46:39,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-18 09:46:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:39,180 INFO L225 Difference]: With dead ends: 490 [2018-11-18 09:46:39,180 INFO L226 Difference]: Without dead ends: 350 [2018-11-18 09:46:39,181 INFO L604 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-11-18 09:46:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-18 09:46:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 200. [2018-11-18 09:46:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 09:46:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 268 transitions. [2018-11-18 09:46:39,189 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 268 transitions. Word has length 47 [2018-11-18 09:46:39,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:39,189 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 268 transitions. [2018-11-18 09:46:39,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:46:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 268 transitions. [2018-11-18 09:46:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 09:46:39,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:39,190 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1] [2018-11-18 09:46:39,191 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:39,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:39,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1002470733, now seen corresponding path program 1 times [2018-11-18 09:46:39,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:39,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:39,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:39,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:39,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 09:46:39,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:39,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:46:39,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:46:39,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:46:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:46:39,251 INFO L87 Difference]: Start difference. First operand 200 states and 268 transitions. Second operand 5 states. [2018-11-18 09:46:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:39,275 INFO L93 Difference]: Finished difference Result 337 states and 461 transitions. [2018-11-18 09:46:39,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:46:39,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-18 09:46:39,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:39,276 INFO L225 Difference]: With dead ends: 337 [2018-11-18 09:46:39,276 INFO L226 Difference]: Without dead ends: 172 [2018-11-18 09:46:39,277 INFO L604 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-11-18 09:46:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-18 09:46:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-11-18 09:46:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 09:46:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 232 transitions. [2018-11-18 09:46:39,284 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 232 transitions. Word has length 50 [2018-11-18 09:46:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:39,284 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 232 transitions. [2018-11-18 09:46:39,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:46:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 232 transitions. [2018-11-18 09:46:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 09:46:39,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:39,287 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:39,288 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:39,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1982405281, now seen corresponding path program 1 times [2018-11-18 09:46:39,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:39,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:39,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 09:46:39,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:39,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:46:39,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:46:39,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:46:39,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:46:39,337 INFO L87 Difference]: Start difference. First operand 172 states and 232 transitions. Second operand 3 states. [2018-11-18 09:46:39,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:39,350 INFO L93 Difference]: Finished difference Result 235 states and 318 transitions. [2018-11-18 09:46:39,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:46:39,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-18 09:46:39,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:39,353 INFO L225 Difference]: With dead ends: 235 [2018-11-18 09:46:39,353 INFO L226 Difference]: Without dead ends: 202 [2018-11-18 09:46:39,353 INFO L604 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-11-18 09:46:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-18 09:46:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-11-18 09:46:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-18 09:46:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 273 transitions. [2018-11-18 09:46:39,360 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 273 transitions. Word has length 56 [2018-11-18 09:46:39,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:39,361 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 273 transitions. [2018-11-18 09:46:39,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:46:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 273 transitions. [2018-11-18 09:46:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 09:46:39,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:39,370 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:39,371 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:39,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:39,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1707645667, now seen corresponding path program 1 times [2018-11-18 09:46:39,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:39,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:39,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:39,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:39,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 09:46:39,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:39,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:46:39,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:46:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:46:39,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:46:39,420 INFO L87 Difference]: Start difference. First operand 202 states and 273 transitions. Second operand 4 states. [2018-11-18 09:46:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:39,464 INFO L93 Difference]: Finished difference Result 397 states and 553 transitions. [2018-11-18 09:46:39,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:46:39,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-18 09:46:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:39,465 INFO L225 Difference]: With dead ends: 397 [2018-11-18 09:46:39,466 INFO L226 Difference]: Without dead ends: 223 [2018-11-18 09:46:39,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:46:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-18 09:46:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 165. [2018-11-18 09:46:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-18 09:46:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2018-11-18 09:46:39,471 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 56 [2018-11-18 09:46:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:39,472 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2018-11-18 09:46:39,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:46:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2018-11-18 09:46:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 09:46:39,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:39,473 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1] [2018-11-18 09:46:39,475 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:39,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash -574320215, now seen corresponding path program 1 times [2018-11-18 09:46:39,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:39,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:39,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 34 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 09:46:39,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:46:39,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/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-11-18 09:46:39,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:39,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:46:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 09:46:39,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:46:39,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-18 09:46:39,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:46:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:46:39,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:46:39,678 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 7 states. [2018-11-18 09:46:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:39,929 INFO L93 Difference]: Finished difference Result 448 states and 629 transitions. [2018-11-18 09:46:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:46:39,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-18 09:46:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:39,930 INFO L225 Difference]: With dead ends: 448 [2018-11-18 09:46:39,931 INFO L226 Difference]: Without dead ends: 275 [2018-11-18 09:46:39,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:46:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-18 09:46:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 196. [2018-11-18 09:46:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-18 09:46:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 237 transitions. [2018-11-18 09:46:39,939 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 237 transitions. Word has length 74 [2018-11-18 09:46:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:39,940 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 237 transitions. [2018-11-18 09:46:39,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:46:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 237 transitions. [2018-11-18 09:46:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 09:46:39,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:39,941 INFO L375 BasicCegarLoop]: trace histogram [5, 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, 1] [2018-11-18 09:46:39,942 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:39,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:39,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1693291530, now seen corresponding path program 1 times [2018-11-18 09:46:39,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:39,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:39,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:39,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:39,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 47 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-18 09:46:40,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:46:40,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/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-11-18 09:46:40,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:40,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:46:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 09:46:40,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:46:40,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-11-18 09:46:40,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 09:46:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 09:46:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:46:40,231 INFO L87 Difference]: Start difference. First operand 196 states and 237 transitions. Second operand 13 states. [2018-11-18 09:46:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:42,002 INFO L93 Difference]: Finished difference Result 2317 states and 2818 transitions. [2018-11-18 09:46:42,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 09:46:42,002 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2018-11-18 09:46:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:42,006 INFO L225 Difference]: With dead ends: 2317 [2018-11-18 09:46:42,006 INFO L226 Difference]: Without dead ends: 2045 [2018-11-18 09:46:42,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=432, Invalid=1638, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 09:46:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2018-11-18 09:46:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 595. [2018-11-18 09:46:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-11-18 09:46:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 778 transitions. [2018-11-18 09:46:42,024 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 778 transitions. Word has length 91 [2018-11-18 09:46:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:42,024 INFO L480 AbstractCegarLoop]: Abstraction has 595 states and 778 transitions. [2018-11-18 09:46:42,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 09:46:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 778 transitions. [2018-11-18 09:46:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 09:46:42,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:42,026 INFO L375 BasicCegarLoop]: trace histogram [5, 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, 1] [2018-11-18 09:46:42,026 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:42,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:42,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1395283369, now seen corresponding path program 1 times [2018-11-18 09:46:42,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:42,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:42,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:42,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:42,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 09:46:42,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:46:42,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/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-11-18 09:46:42,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:42,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:46:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 50 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 09:46:42,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:46:42,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-11-18 09:46:42,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 09:46:42,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 09:46:42,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:46:42,437 INFO L87 Difference]: Start difference. First operand 595 states and 778 transitions. Second operand 14 states. [2018-11-18 09:46:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:43,457 INFO L93 Difference]: Finished difference Result 2544 states and 3138 transitions. [2018-11-18 09:46:43,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 09:46:43,458 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2018-11-18 09:46:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:43,462 INFO L225 Difference]: With dead ends: 2544 [2018-11-18 09:46:43,462 INFO L226 Difference]: Without dead ends: 1950 [2018-11-18 09:46:43,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-11-18 09:46:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2018-11-18 09:46:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 613. [2018-11-18 09:46:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-11-18 09:46:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 800 transitions. [2018-11-18 09:46:43,482 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 800 transitions. Word has length 94 [2018-11-18 09:46:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:43,482 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 800 transitions. [2018-11-18 09:46:43,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 09:46:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 800 transitions. [2018-11-18 09:46:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-18 09:46:43,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:43,484 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:46:43,484 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:43,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash 699262061, now seen corresponding path program 1 times [2018-11-18 09:46:43,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:43,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:43,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:43,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:43,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 09:46:43,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:46:43,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589870e3-579c-4a04-9256-4b1f1112712d/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-11-18 09:46:43,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:43,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:46:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 09:46:43,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:46:43,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2018-11-18 09:46:43,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:46:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:46:43,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:46:43,676 INFO L87 Difference]: Start difference. First operand 613 states and 800 transitions. Second operand 8 states. [2018-11-18 09:46:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:43,924 INFO L93 Difference]: Finished difference Result 1607 states and 2105 transitions. [2018-11-18 09:46:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:46:43,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-11-18 09:46:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:43,928 INFO L225 Difference]: With dead ends: 1607 [2018-11-18 09:46:43,928 INFO L226 Difference]: Without dead ends: 1026 [2018-11-18 09:46:43,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:46:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-11-18 09:46:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2018-11-18 09:46:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2018-11-18 09:46:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1302 transitions. [2018-11-18 09:46:43,954 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1302 transitions. Word has length 100 [2018-11-18 09:46:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:43,954 INFO L480 AbstractCegarLoop]: Abstraction has 1002 states and 1302 transitions. [2018-11-18 09:46:43,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:46:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1302 transitions. [2018-11-18 09:46:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 09:46:43,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:43,956 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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-11-18 09:46:43,956 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:43,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1911156114, now seen corresponding path program 2 times [2018-11-18 09:46:43,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:43,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:43,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:46:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:46:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-18 09:46:43,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:46:43,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:46:43,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:46:43,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:46:43,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:46:43,987 INFO L87 Difference]: Start difference. First operand 1002 states and 1302 transitions. Second operand 3 states. [2018-11-18 09:46:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:46:44,062 INFO L93 Difference]: Finished difference Result 1815 states and 2320 transitions. [2018-11-18 09:46:44,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:46:44,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-11-18 09:46:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:46:44,065 INFO L225 Difference]: With dead ends: 1815 [2018-11-18 09:46:44,065 INFO L226 Difference]: Without dead ends: 625 [2018-11-18 09:46:44,066 INFO L604 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-11-18 09:46:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-18 09:46:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 521. [2018-11-18 09:46:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-11-18 09:46:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 627 transitions. [2018-11-18 09:46:44,080 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 627 transitions. Word has length 109 [2018-11-18 09:46:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:46:44,080 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 627 transitions. [2018-11-18 09:46:44,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:46:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 627 transitions. [2018-11-18 09:46:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 09:46:44,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:46:44,081 INFO L375 BasicCegarLoop]: trace histogram [5, 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, 1] [2018-11-18 09:46:44,082 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 09:46:44,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:46:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash 831355282, now seen corresponding path program 1 times [2018-11-18 09:46:44,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:46:44,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:46:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:44,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:46:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:46:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:46:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:46:44,148 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 09:46:44,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:46:44 BoogieIcfgContainer [2018-11-18 09:46:44,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:46:44,196 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:46:44,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:46:44,196 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:46:44,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:46:37" (3/4) ... [2018-11-18 09:46:44,199 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:46:44,200 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:46:44,200 INFO L168 Benchmark]: Toolchain (without parser) took 7204.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.6 MB). Free memory was 953.8 MB in the beginning and 943.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 368.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:46:44,201 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:46:44,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.95 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:46:44,202 INFO L168 Benchmark]: Boogie Preprocessor took 65.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -244.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:46:44,202 INFO L168 Benchmark]: RCFGBuilder took 360.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:46:44,203 INFO L168 Benchmark]: TraceAbstraction took 6552.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.8 MB). Free memory was 1.2 GB in the beginning and 943.3 MB in the end (delta: 208.5 MB). Peak memory consumption was 377.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:46:44,203 INFO L168 Benchmark]: Witness Printer took 3.62 ms. Allocated memory is still 1.4 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:46:44,206 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 217.95 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -244.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 360.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6552.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.8 MB). Free memory was 1.2 GB in the beginning and 943.3 MB in the end (delta: 208.5 MB). Peak memory consumption was 377.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.62 ms. Allocated memory is still 1.4 GB. Free memory is still 943.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; [L106] a = __VERIFIER_nondet_uint() [L108] b = 234770789 VAL [a=-2382254337, b=234770789] [L110] CALL mp_add(a, b) VAL [\old(a)=1912712959, \old(b)=234770789] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L40] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L49] nb = (unsigned char)4 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L66] COND TRUE i == (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=917074] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, 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, 128 locations, 38 error locations. UNSAFE Result, 6.5s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1669 SDtfs, 2704 SDslu, 4636 SDs, 0 SdLazy, 4318 SolverSat, 379 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 372 SyntacticMatches, 13 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1002occurred in iteration=13, 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, 3475 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1285 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1155 ConstructedInterpolants, 140 QuantifiedInterpolants, 525352 SizeOfPredicates, 11 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 880/982 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...